On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes

Simple item page
dc.creatorBras-Amorós, Maria
dc.creatorO'Sullivan, Michael E.
dc.date2006-09-29
dc.date2006-11-15
dc.date.accessioned2026-07-07T08:18:02Z
dc.date.available2026-07-07T08:18:02Z
dc.descriptionAnalysis 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.
dc.descriptionAdded references
dc.identifierhttps://arxiv.org/abs/cs/0609162
dc.identifierhttp://arxiv.org/abs/cs/0609162
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134297
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectE.4
dc.titleOn Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes
dc.typetext

Files

Collections

arXiv