For every twin prime and prime power p where p ≡ 3(4) we define a (2p + 2, p + 1) binary code by a generator matrix of the form G = [I, Sp, where Sp is given in terms of the incidence matrix of a difference set of the Hadamard type.For p ≡ 3(8) these codes are shown to be self-dual with weights divisible by four.For p = 7, 15, 23, 27, 31 and 35 the codes obtained are probably new and it is not known if they are related to cyclic codes. For p = 7, 15, 19 and 23 we present their weight distributions
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
AbstractWe introduce a new infinite family of quaternary cyclic (n, (n+1)2) and (n, (n − 1)2) codes ...
AbstractA general method unifying known constructions of binary self-orthogonal codes from combinato...
For every twin prime and prime power p where p ≡ 3(4) we define a (2p + 2, p + 1) binary code by a g...
AbstractA (70,35) circulant code was previously characterized in terms of the incidence matrix of a ...
AbstractUsing a spread ofPG(3, p) and certain projective two-weight codes, we give a general constru...
In this note, we study self-dual codes constructed from Hadamard matrices. We also give a classifica...
AbstractIn [3] we introduced a new family of binary, cyclic (n, (n+1)2) and (n, (n-1)2) codes which ...
There is a one-to-one correspondence between ℓ-quasi-cyclic codes over a finite field Fq and linear ...
AbstractLinear codes overGF(5) are utilized for the construction of a reversible abelian Hadamard di...
AbstractThere is a one-to-one correspondence between ℓ-quasi-cyclic codes over a finite field Fq and...
AbstractWe give a general experimental method generalizing the codes of Carlach and Vervoux (Proceed...
Linear codes over GF(5) are utilized for the construction of a reversible abelian Hadamard differenc...
The incidence matrix of a (v, k, λ) configuration is used to construct a (2v, v) and a (2v + 2, v + ...
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
AbstractWe introduce a new infinite family of quaternary cyclic (n, (n+1)2) and (n, (n − 1)2) codes ...
AbstractA general method unifying known constructions of binary self-orthogonal codes from combinato...
For every twin prime and prime power p where p ≡ 3(4) we define a (2p + 2, p + 1) binary code by a g...
AbstractA (70,35) circulant code was previously characterized in terms of the incidence matrix of a ...
AbstractUsing a spread ofPG(3, p) and certain projective two-weight codes, we give a general constru...
In this note, we study self-dual codes constructed from Hadamard matrices. We also give a classifica...
AbstractIn [3] we introduced a new family of binary, cyclic (n, (n+1)2) and (n, (n-1)2) codes which ...
There is a one-to-one correspondence between ℓ-quasi-cyclic codes over a finite field Fq and linear ...
AbstractLinear codes overGF(5) are utilized for the construction of a reversible abelian Hadamard di...
AbstractThere is a one-to-one correspondence between ℓ-quasi-cyclic codes over a finite field Fq and...
AbstractWe give a general experimental method generalizing the codes of Carlach and Vervoux (Proceed...
Linear codes over GF(5) are utilized for the construction of a reversible abelian Hadamard differenc...
The incidence matrix of a (v, k, λ) configuration is used to construct a (2v, v) and a (2v + 2, v + ...
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
AbstractWe introduce a new infinite family of quaternary cyclic (n, (n+1)2) and (n, (n − 1)2) codes ...
AbstractA general method unifying known constructions of binary self-orthogonal codes from combinato...