On algebraic methods in covering radius problems



: Honkala I, Litsyn S, Tietavainen A

: Cohen G, Giusti M, Mora T

: 1995

: Lecture Notes in Computer Science

: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

: APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES

: LECT NOTES COMPUT SC

: 948

: 21

: 32

: 12

: 3-540-60114-7

: 0302-9743


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.



Last updated on 2024-26-11 at 18:53