Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension

Authors:
Sabine Kampf
Affiliations:
Institute of Communications Engineering, University of Ulm, Ulm, Germany
Venue:
Designs, Codes and Cryptography
Year:
2014

Citing 11
Cited 0

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Decoding Hermitian Codes with Sudan's Algorithm

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs

IEEE Transactions on Information Theory
Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis

IEEE Transactions on Information Theory
Improved decoding of interleaved AG codes

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
On the decoding of algebraic-geometric codes

IEEE Transactions on Information Theory - Part 1
A generalized Euclidean algorithm for multisequence shift-register synthesis

IEEE Transactions on Information Theory
List decoding of algebraic-geometric codes

IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes

IEEE Transactions on Information Theory
Decoding geometric Goppa codes using an extra place

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive the maximum decoding radius for interleaved Hermitian (IH) codes if a collaborative decoding scheme is used. A decoding algorithm that achieves this bound, which is based on a division decoding algorithm, is given. Based on the decoding radius for the interleaved codes, we derive a bound on the code rate below which virtual extension of non-interleaved Hermitian codes can improve the decoding capabilities.