Back to Search
Start Over
Comparing decoding methods for quaternary linear codes
- Source :
- Recercat: Dipósit de la Recerca de Catalunya, Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya), Recercat. Dipósit de la Recerca de Catalunya, instname, Dipòsit Digital de Documents de la UAB, Universitat Autònoma de Barcelona
- Publication Year :
- 2021
-
Abstract
- Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z 4 -linear codes (Hadamard and Kerdock) are given. Moreover, different decoding methods for Z4-linear codes are compared by showing their performance applied to these two families.
- Subjects :
- Block code
Discrete mathematics
Berlekamp–Welch algorithm
Hadamard codes
Applied Mathematics
Concatenated error correction code
Decoding
List decoding
020206 networking & telecommunications
0102 computer and information sciences
02 engineering and technology
Sequential decoding
01 natural sciences
Linear code
Combinatorics
Permutation
010201 computation theory & mathematics
Kerdock codes
Z₄-linear codes
0202 electrical engineering, electronic engineering, information engineering
Discrete Mathematics and Combinatorics
Decoding methods
Mathematics
Computer Science::Information Theory
PD-sets
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- Recercat: Dipósit de la Recerca de Catalunya, Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya), Recercat. Dipósit de la Recerca de Catalunya, instname, Dipòsit Digital de Documents de la UAB, Universitat Autònoma de Barcelona
- Accession number :
- edsair.doi.dedup.....bac8510780c5c643e51591d036fcd7d1