A4 Refereed article in a conference publication
On algebraic methods in covering radius problems
Authors: Honkala I, Litsyn S, Tietavainen A
Editors: Cohen G, Giusti M, Mora T
Publication year: 1995
Journal:Lecture Notes in Computer Science
Book title : Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Journal name in sourceAPPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES
Journal acronym: LECT NOTES COMPUT SC
Volume: 948
First page : 21
Last page: 32
Number of pages: 12
ISBN: 3-540-60114-7
ISSN: 0302-9743
Abstract
We discuss how characters of finite fields and exponential sums can be applied to covering radius problems. In particular we study the covering radius of BCH codes, and upper bounds on the covering radius of a code with a given dual distance.
We discuss how characters of finite fields and exponential sums can be applied to covering radius problems. In particular we study the covering radius of BCH codes, and upper bounds on the covering radius of a code with a given dual distance.
UTU Research Portal