On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes
From MaRDI portal
Publication:3548905
DOI10.1109/TIT.2007.899548zbMATH Open1325.94160DBLPjournals/tit/Bras-AmorosO07arXivcs/0609162OpenAlexW2097516772WikidataQ57728732 ScholiaQ57728732MaRDI QIDQ3548905FDOQ3548905
Authors: Maria Bras-Amorós, Michael E. O'Sullivan 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm. The second method is to design the code to correct only those error vectors of a given weight that are also geometrically generic. In this work, formulae are given for the redundancies of Hermitian codes optimized with respect to these criteria as well as the formula for the order bound on the minimum distance. The results proceed from an analysis of numerical semigroups generated by two consecutive integers. The formula for the redundancy of optimal Hermitian codes correcting a given number of errors answers an open question stated by Pellikaan and Torres in 1999.
Full work available at URL: https://arxiv.org/abs/cs/0609162
Recommendations
- Hermitian codes as generalized Reed-Solomon codes
- On numerical semigroups and the redundancy of improved codes correcting generic errors
- On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
- A note on Hermitian codes over GF(q/sup 2/)
- On the Structure of Hermitian Codes and Decoding for Burst Errors
Cited In (1)
This page was built for publication: On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548905)
