We 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). 1 Review of the theory Let IFq be the ground field, F = IF q 2. Denote the interval {i, i + 1,..., j} ⊂ ZZ/(q 2 −1)ZZ by [i, j]. Let A = [i, j] ⊂ ZZ/(q 2 −1)ZZ. Interval A determines a (primitive) BCH-code C(A) of length q 2 −1 and minimum distance ≥ | A | +1. The dimension of C(A) is determined with the help of cyclotomic cosets. The cyclotomic coset containing i ∈ ZZ/(q 2 − 1)ZZ is Z(i) = {i, qi} ⊂ ZZ/(q 2 − 1)ZZ. We have | Z(i) | = 1 if and only if (q + 1) | i, | Z(i) | = 2 otherwise. ZZ/(q 2 − 1)ZZ...
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub a...
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...
AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our met...
Using the characterization of the idempotents of a narrow-sense primitive binary BCH code, we are ab...
Using a new parity check matrix a class of convolutional codes with a designed free distance is intr...
ABSTRACT In this work, we introduce a method by which it is established that how a sequence of non-p...
For every prime-power q and every pair of natural numbers m ≤ n′, we construct a q-ary linear code o...
A binary codeword is a vector v = (a0 a1... an) ∈ Fn+12 that is used to transmit information. Note ...
Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in ...
Cyclic codes generated by polynomials having multiple sets of do — 1 roots in consecutive powers of ...
Integrated studies completion of BCH codes of different lengths is devoted. Most attention is paid t...
BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite field...
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub a...
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...
AbstractWe construct a large number of record-breaking binary, ternary and quaternary codes. Our met...
Using the characterization of the idempotents of a narrow-sense primitive binary BCH code, we are ab...
Using a new parity check matrix a class of convolutional codes with a designed free distance is intr...
ABSTRACT In this work, we introduce a method by which it is established that how a sequence of non-p...
For every prime-power q and every pair of natural numbers m ≤ n′, we construct a q-ary linear code o...
A binary codeword is a vector v = (a0 a1... an) ∈ Fn+12 that is used to transmit information. Note ...
Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in ...
Cyclic codes generated by polynomials having multiple sets of do — 1 roots in consecutive powers of ...
Integrated studies completion of BCH codes of different lengths is devoted. Most attention is paid t...
BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite field...
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub a...