AuthorsH. Raddum
TitleOn the computation of coset leaders with high Hamming weight
Afilliation, Communication Systems
Project(s)Simula UiB
StatusPublished
Publication TypeJournal Article
Year of Publication2004
JournalDiscrete Mathematics
Volume274
Issue1-3
Pagination213-231
Date Published01/2004
PublisherElsevier
KeywordsCovering radius, Modular representation, Newton radius
Abstract

The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. In this paper, we use the modular representation of a linear code to give an efficient algorithm for computing coset leaders of relatively high Hamming weight. The weights of these coset leaders serve as lower bounds on the Newton radius and the covering radius for linear codes.

DOI10.1016/S0012-365X(03)00090-6
Citation Key24077

Contact person