BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite fields
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...
Linear codes over the ring of integers modulo q = pr, p a prime, are considered. Natural analogs to ...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
Given an integer m which is a product of distinct primes pi, a method is given for constructing code...
AbstractCodes over p-adic numbers and over integers modulo pd of block length pm invariant under the...
BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite field...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...
A generalization of McEliece's theorem on the p-adic valuation of Hamming weights of words in cyclic...
AbstractIt is well known that cyclic linear codes of length n over a (finite) field F can be charact...
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
AbstractBCH codes over arbitrary finite commutative rings with identity are derived in terms of thei...
Several authors have established that many classical codes are ideals in certain ring constructions....
In this correspondence we present a decoding procedure for Reed-Solomon (RS) and BCH codes defined o...
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...
Linear codes over the ring of integers modulo q = pr, p a prime, are considered. Natural analogs to ...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
Given an integer m which is a product of distinct primes pi, a method is given for constructing code...
AbstractCodes over p-adic numbers and over integers modulo pd of block length pm invariant under the...
BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite field...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...
A generalization of McEliece's theorem on the p-adic valuation of Hamming weights of words in cyclic...
AbstractIt is well known that cyclic linear codes of length n over a (finite) field F can be charact...
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
AbstractBCH codes over arbitrary finite commutative rings with identity are derived in terms of thei...
Several authors have established that many classical codes are ideals in certain ring constructions....
In this correspondence we present a decoding procedure for Reed-Solomon (RS) and BCH codes defined o...
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...