Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension

DOI10.1007/s10623-012-9625-2zbMath1285.14030OpenAlexW2136541826MaRDI QIDQ2436580

Sabine Kampf

Publication date: 25 February 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9625-2

zbMATH Keywords

decoding radiusdecoding of Hermitian codesinterleaved Hermitian codesvirtual extension

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)

Related Items

Improved power decoding of interleaved one-point Hermitian codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
• Algebraic function fields and codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• Decoding geometric Goppa codes using an extra place
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• List decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
• Cryptography and Coding

This page was built for publication: Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension