AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X and variants of the Griesmer construction (residual codes)
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Treball inclòs a la publicació que recull les contribucions al XIII Encuentro de Álgebra Computacion...
International audienceOnly primitive binary cyclic codes of length n = 2^m - 1 are considered. A BCH...
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...
AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our met...
Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in ...
AbstractIt is shown how ternary BCH codes can be lengthened to get linear codes with covering radius...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
International audienceWe consider primitive cyclic codes of length p^m-1 over Fp. The codes of inter...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
AbstractA new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple wa...
International audienceWe consider duals of BCH codes of length p^m-1 over GF(p). A lower bound on th...
The BCH bound approaches zero with increasing code length for any fixed value of the ratio of minimu...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Treball inclòs a la publicació que recull les contribucions al XIII Encuentro de Álgebra Computacion...
International audienceOnly primitive binary cyclic codes of length n = 2^m - 1 are considered. A BCH...
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...
AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our met...
Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in ...
AbstractIt is shown how ternary BCH codes can be lengthened to get linear codes with covering radius...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
International audienceWe consider primitive cyclic codes of length p^m-1 over Fp. The codes of inter...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
AbstractA new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple wa...
International audienceWe consider duals of BCH codes of length p^m-1 over GF(p). A lower bound on th...
The BCH bound approaches zero with increasing code length for any fixed value of the ratio of minimu...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Treball inclòs a la publicació que recull les contribucions al XIII Encuentro de Álgebra Computacion...
International audienceOnly primitive binary cyclic codes of length n = 2^m - 1 are considered. A BCH...
DOI
Add to ORKG