Computer Science – Information Theory
Scientific paper
2006-09-29
Computer Science
Information Theory
Added references
Scientific paper
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.
Bras-Amorós Maria
O'Sullivan Michael E.
No associations
LandOfFree
On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-184257