Decoding of linear codes over Galois rings

DOI10.1109/18.923743zbMath1017.94023OpenAlexW2144664588MaRDI 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

zbMATH Keywords

linear codeGalois ringlifting decoding

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (4)

Construction of binary Hadamard codes and their \(s\)-PD sets ⋮ On structure and distances of some classes of repeated-root constacyclic codes over Galois rings ⋮ Comparing decoding methods for quaternary linear codes ⋮ Characterization of cyclic codes over {ℬ[X;(1/m)Z₀}_{m > 1}and efficient encoding decoding algorithm for cyclic codes]

This page was built for publication: Decoding of linear codes over Galois rings