Comparing decoding methods for quaternary linear codes
From MaRDI portal
Publication:510602
DOI10.1016/j.endm.2016.09.049zbMath1419.94087OpenAlexW2538118183MaRDI QIDQ510602
Jaume Pujol, Roland D. Barrolleta, Mercè Villanueva
Publication date: 13 February 2017
Full work available at URL: http://ddd.uab.cat/record/165799
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Partial permutation decoding for binary linear Hadamard codes
- Partial permutation decoding for simplex codes
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Decoding of linear codes over Galois rings
This page was built for publication: Comparing decoding methods for quaternary linear codes