Computing the reciprocal of units in Galois rings
From MaRDI portal
Publication:4549929
DOI10.1080/09720529.2000.10697897zbMath1032.12004OpenAlexW2077866651MaRDI QIDQ4549929
J. Carmelo Interlando, Reginaldo jun. Palazzo, Michele Elia
Publication date: 28 October 2002
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2000.10697897
Related Items (3)
On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime ⋮ Construction and decoding of BCH codes over chain of commutative rings ⋮ Transmission of intra-cellular genetic information: a system proposal
Cites Work
- On BCH codes over arbitrary integer tings (Corresp.)
- Codes over integer residue rings
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing the reciprocal of units in Galois rings