We provide a new concatenated structure for multidimensional quasi-cyclic (QnDC) codes over F-q and we give a trace representation for their codewords, which extends the known representations of QC and nD cyclic codes. Based on these results, we obtain a minimum distance bound for QnDC dyclic codes. Since QnDC codes are naturally related to nD convolutional codes, this bound also applies to a special class of 1-generator 2D convolutional codes
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Abstract—A new approach to bound the minimum distance of q-ary cyclic codes is presented. The connec...
A code is s-quasi-cyclic (s-QC) if there is an integer s such that cyclic shift of a codeword by s-p...
We introduce multidimensional analogues of quasi-cyclic (QC) codes and study their algebraic structu...
Following Jensen's work from 1985, a quasi-cyclic code can be written as a direct sum of concatenate...
We study multidimensional analogues of quasi-twisted codes from different points of view. Their conc...
We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and ...
One of the most important and challenging problems in coding theory is to construct codes with optim...
One of the most important and challenging problems in coding theory is to construct codes with optim...
International audienceWe recall a classic lower bound on the minimum Hamming distance of constacycli...
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the descriptio...
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive se...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Abstract—A new approach to bound the minimum distance of q-ary cyclic codes is presented. The connec...
A code is s-quasi-cyclic (s-QC) if there is an integer s such that cyclic shift of a codeword by s-p...
We introduce multidimensional analogues of quasi-cyclic (QC) codes and study their algebraic structu...
Following Jensen's work from 1985, a quasi-cyclic code can be written as a direct sum of concatenate...
We study multidimensional analogues of quasi-twisted codes from different points of view. Their conc...
We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and ...
One of the most important and challenging problems in coding theory is to construct codes with optim...
One of the most important and challenging problems in coding theory is to construct codes with optim...
International audienceWe recall a classic lower bound on the minimum Hamming distance of constacycli...
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the descriptio...
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive se...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Abstract—A new approach to bound the minimum distance of q-ary cyclic codes is presented. The connec...
A code is s-quasi-cyclic (s-QC) if there is an integer s such that cyclic shift of a codeword by s-p...