Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission
From MaRDI portal
Publication:4628712
DOI10.1142/S0219498818502389zbMath1439.94099OpenAlexW2786071501MaRDI QIDQ4628712
Riffat Perveen, Tariq Shah, Anam Kazmi, Asma Shaheen Ansari, Antonio Aparecido de Andrade
Publication date: 15 March 2019
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498818502389
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Extensions of associative rings by ideals (16S70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A method for improving the code rate and error correction capability of a cyclic code
- Encoding through generalized polynomial codes
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Construction and decoding of BCH codes over finite commutative rings
- Algorithms for computing parameters of graph-based extensions of BCH codes
- A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
- CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON]
- On BCH codes over arbitrary integer tings (Corresp.)
- Codes over integer residue rings
- Codes over Zm
- Codes over Zm, revisited
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- Linear Codes over Finite Rings
- On decoding BCH codes
- Codes over certain rings
This page was built for publication: Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission
