Decoding of linear codes over Galois rings
From MaRDI portal
Publication:4544596
DOI10.1109/18.923743zbMath1017.94023MaRDI QIDQ4544596
N. Suresh Babu, Karl-Heinz Zimmermann
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.923743
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
94B35: Decoding
Related Items
Characterization of cyclic codes over {ℬ[X;(1/m)Z0}m > 1and efficient encoding decoding algorithm for cyclic codes], On structure and distances of some classes of repeated-root constacyclic codes over Galois rings, Comparing decoding methods for quaternary linear codes, Construction of binary Hadamard codes and their \(s\)-PD sets