Error-correction of linear codes via colon ideals

JOURNAL OF ALGEBRA

卷:443

Article

Anzis, Benjamin¹  Tohaneanu, Stefan O.¹ 

[1] Univ Idaho, Dept Math, Moscow, ID 83844 USA

关键词: Linear codes;    Minimum distance;    Saturation;    Colon ideals;    Castelnuovo-Mumford regularity;    Free resolutions;   

DOI  :  10.1016/j.jalgebra.2015.07.035

来源: Elsevier

【 摘 要 】

We show that errors in data transmitted through linear codes can be thought of as codewords of minimum weight of new linear codes. To determine errors we can then use methods specific to finding such special codewords. One of these methods consists of finding the primary decomposition of the saturation of a certain homogeneous ideal. When good words (i.e. vectors with a unique nearest neighbor) are error-corrected, the saturated ideal is just the prime ideal of a point (so the primary decomposition is superfluously determined); we show that this ideal can be computed by coloning the original homogeneous ideal with a power of a certain variable. We then determine the smallest such power for any linear code. (C) 2015 Elsevier Inc. All rights reserved.

【 授权许可】

Free