A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of Goethals is constructed. These new codes have associated designed distances, which give lower bounds for their error-correcting capability. We also give a new construction of orthogonal idempotents, and hence of minimal ideals, in any semisimple commutative algebra
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes ...
Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms...
Several authors have established that many classical codes are ideals in certain ring constructions....
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
AbstractRecently some methods have been proposed to find the distance and weight distribution of cyc...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
Cyclic codes generated by polynomials having multiple sets of do — 1 roots in consecutive powers of ...
In the first part of this paper linear, quadratic,…arbitrary n-block codes are studied by means of a...
It is very well known that algebraic structures have valuable applications in the theory of error-co...
AbstractBCH codes over arbitrary finite commutative rings with identity are derived in terms of thei...
In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for...
We define two classes of linear error correcting codes which are noncyclic generalizations of the we...
Bose-Chaudhuri-Hocquenghem (BCH) codes are very powerful random error-correcting techniques. We have...
BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite field...
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes ...
Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms...
Several authors have established that many classical codes are ideals in certain ring constructions....
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
AbstractRecently some methods have been proposed to find the distance and weight distribution of cyc...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
Cyclic codes generated by polynomials having multiple sets of do — 1 roots in consecutive powers of ...
In the first part of this paper linear, quadratic,…arbitrary n-block codes are studied by means of a...
It is very well known that algebraic structures have valuable applications in the theory of error-co...
AbstractBCH codes over arbitrary finite commutative rings with identity are derived in terms of thei...
In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for...
We define two classes of linear error correcting codes which are noncyclic generalizations of the we...
Bose-Chaudhuri-Hocquenghem (BCH) codes are very powerful random error-correcting techniques. We have...
BCH codes are constructed over integer residue rings by using BCH oces over both p-adic finite field...
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes ...
Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms...
Several authors have established that many classical codes are ideals in certain ring constructions....
DOI
Add to ORKG