Algebraic Soft-Decision Decoding of Hermitian Codes

DOI10.1109/TIT.2010.2046208zbMath1366.94710arXiv0807.4995OpenAlexW2142693450MaRDI QIDQ5281437

Michael E. O'Sullivan, Kwankyu Lee

Publication date: 27 July 2017

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

Full work available at URL: https://arxiv.org/abs/0807.4995

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (9)

Recursive numerical recipes for the high efficient inversion of the confluent Vandermonde matrices ⋮ Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes ⋮ On the geometry of Hermitian one-point codes ⋮ Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices ⋮ A general preconditioner for linear complementarity problem with an \(M\)-matrix ⋮ Incremental numerical recipes for the high efficient inversion of the confluent Vandermonde matrices ⋮ Hermitian codes and complete intersections ⋮ Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm

This page was built for publication: Algebraic Soft-Decision Decoding of Hermitian Codes