Efficient decoding of Z/sub p/k-linear codes

DOI10.1109/18.669412zbMath0924.94035OpenAlexW1988572938MaRDI QIDQ4400357

Ute Christine Vellbinger, Marcus Greferath

Publication date: 14 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.669412

zbMATH Keywords

linear codesdecoding scheme

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (3)

Construction of binary Hadamard codes and their \(s\)-PD sets ⋮ Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric ⋮ On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3

This page was built for publication: Efficient decoding of Z/sub p/k-linear codes