AbstractIn this paper we treat cyclotomic binary duadic codes. The conjecture of Ding and Pless is that there are infinitely many cyclotomic duadic codes of prime lengths that are not quadratic residue codes. We shall prove this conjecture by using the special case of Tschebotareff's density theorem
We study three domains of algebraic and enumerative combinatorics. Firstly, we are looking for a cou...
A generalization of Ding’s construction is proposed that employs as a defining set the collection of...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...
AbstractLegendre sequences have a number of interesting properties. Their counterparts in coding the...
AbstractIn this paper we first introduce a new generalized cyclotomy of order 2 with respect tope11·...
AbstractDuadic codes are a class of cyclic codes that generalize quadratic residue codes from prime ...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...
AbstractPolyadic codes constitute a special class of cyclic codes and are generalizations of quadrat...
10.1109/ISIT.1998.708838IEEE International Symposium on Information Theory - Proceedings234-PIST
AbstractIn [3] we introduced a new family of binary, cyclic (n, (n+1)2) and (n, (n-1)2) codes which ...
AbstractA new, infinite family of cyclic codes over GF(q), called triadic codes, is defined by means...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
AbstractThis paper extends the concepts from cyclic duadic codes to negacyclic codes over Fq (q an o...
Nous abordons trois axes de la combinatoire algébrique et énumérative. Le premier concerne principal...
With any fixed prime number p and positive integer N, not divisible by p, there is associated an inf...
We study three domains of algebraic and enumerative combinatorics. Firstly, we are looking for a cou...
A generalization of Ding’s construction is proposed that employs as a defining set the collection of...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...
AbstractLegendre sequences have a number of interesting properties. Their counterparts in coding the...
AbstractIn this paper we first introduce a new generalized cyclotomy of order 2 with respect tope11·...
AbstractDuadic codes are a class of cyclic codes that generalize quadratic residue codes from prime ...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...
AbstractPolyadic codes constitute a special class of cyclic codes and are generalizations of quadrat...
10.1109/ISIT.1998.708838IEEE International Symposium on Information Theory - Proceedings234-PIST
AbstractIn [3] we introduced a new family of binary, cyclic (n, (n+1)2) and (n, (n-1)2) codes which ...
AbstractA new, infinite family of cyclic codes over GF(q), called triadic codes, is defined by means...
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al....
AbstractThis paper extends the concepts from cyclic duadic codes to negacyclic codes over Fq (q an o...
Nous abordons trois axes de la combinatoire algébrique et énumérative. Le premier concerne principal...
With any fixed prime number p and positive integer N, not divisible by p, there is associated an inf...
We study three domains of algebraic and enumerative combinatorics. Firstly, we are looking for a cou...
A generalization of Ding’s construction is proposed that employs as a defining set the collection of...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...