On algebraic methods in covering radius problems

DOI10.1007/3-540-60114-7_3MaRDI QIDQ4352782zbMATH OpenFDO

Authors Iiro Honkala, Simon Litsyn, Aimo Tietäväinen

Publication date 26 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60114-7_3

zbMATH Keywords

BCH codescharacterscovering radiusdual distanceexponential sumsfinite fieldsnormality

Mathematics Subject Classification ID

Exponential sums (11T23) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Review text

The covering radius of a binary code \(C\subseteq \mathbb{F}^n_2\) is the smallest integer \(R\) such that every point \(x\in \mathbb{F}^n_2\) is within Hamming distance \(R\) from at least one codeword of \(C\). The purpose of this paper is to discuss how characters of finite fields and exponential sums can be applied to covering radius problems. The authors mainly treat two examples of such applications, namely covering radius and normality of BCH codes, and covering radius of codes with given dual distance. The authors also briefly survey some related results. For the entire collection see [Zbl 0847.00060].

Recommendations

• On an algebraic method for bounding the covering radius
• The reductions for the approximating covering radius problem
• An optimal polynomial for a covering radius problem
• On the multi-radius cover problem
• An algorithmic framework for solving geometric covering problems -- with applications
• Optimal circle covering problems and their applications
• The complexity of the covering radius problem
• On the Geometry of the Solutions of the Cover Problem
• Optimal covering points and related problems
• Algorithms for polytope covering and approximation

Cited in

(5)

• On the covering radius of an unrestricted code as a function of the rate and dual distance
• An algebraic approach to the radius of comparison
• scientific article; zbMATH DE number 4112530 (Why is no real title available?)
• Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
• AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM

This page was built for publication: On algebraic methods in covering radius problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352782)