Pseudo Quasi-3 Designs and their Applications to Coding Theory

Hilbert quasi-polynomial for order domains and application to coding theory

We present an application of Hilbert quasi-polynomials to order domains, allowing the effective check of the second order-domain condition in a direct way. We also provide an improved algorithm for the computation of the related Hilbert quasi-polynomials. This allows to identify order domain codes more easily.

Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach

This paper is concerned with quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices, which are generalizations of unbiased Hadamard matrices, equivalently unbiased bases. These matrices are studied from the viewpoint of coding theory. As a consequence of a coding-theoretic approach, we provide upper bounds on the number of mutually quasi-unbiased Hadamard matrices. We give classifications of a certain class of self-complementary codes for modest lengths. These codes give quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices. Some modification of the notion of w…

On pseudo-involutions, involutions and quasi-involutions in the group of almost Riordan arrays

The group of almost Riordan arrays contains the group of Riordan arrays as a subgroup. In this note, we exhibit examples of pseudo-involutions, involutions and quasi-involutions in the group of almost Riordan arrays.

有界伪序集上的拟重叠函数与拟分组函数

Quasi-overlap and quasi-grouping functions on bounded pseudo-ordered sets

本文在有界伪序集上引入拟重叠与拟分组函数，研究其构造、不变性及相关性质，并提出两种基于边界忠实映射和伴随对的构造方法。

伪可定向带图：矩阵-准树定理和对数凹性

Pseudo-orientable ribbon graphs: Matrix--Quasi-tree Theorem and log-concavity

本文研究了伪可定向带图的性质，推导出矩阵-准树定理和对数凹性结果，并展示了非伪可定向带图的实例。