For every prime-power q and every pair of natural numbers m ≤ n′, we construct a q-ary linear code of length qm(qn′ - 1)(qn′ - qn′-m + 1)/(q - 1) and dimension 3n′, whose only nonzero weights are q2n′+m-1 -q2n′-1 and q2n′+m-1 - q2n′-1 + qn′+m-1. These code parameters and those of the corresponding family of strongly regular graphs are new in odd characteristic
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
A link between the theory of error-correcting codes and (t, m, s)-nets leads to the efficient constr...
AbstractFor any prime power q > 2 we construct a family of linear codes over an alphabet of q letter...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
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 ...
Negacyclic BCH codes are a subclass of neagcyclic codes and are the best linear codes in many cases....
In this correspondance we describe a class of codes over GF(q), where q is a power of an odd prime. ...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...
Let q=3l+2 be a prime power.Maximal designed distances of imprimitive Hermitian dual containing q2-a...
AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our met...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
A link between the theory of error-correcting codes and (t, m, s)-nets leads to the efficient constr...
AbstractFor any prime power q > 2 we construct a family of linear codes over an alphabet of q letter...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
We introduce a new infinite family of quaternary cyclic (n,(n+1)2) and (n,(n − 1)2) codes which incl...
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 ...
Negacyclic BCH codes are a subclass of neagcyclic codes and are the best linear codes in many cases....
In this correspondance we describe a class of codes over GF(q), where q is a power of an odd prime. ...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...
Let q=3l+2 be a prime power.Maximal designed distances of imprimitive Hermitian dual containing q2-a...
AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our met...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
A link between the theory of error-correcting codes and (t, m, s)-nets leads to the efficient constr...