New Quaternary Linear Codes with Covering Radius 2
✍ Scribed by Alexander A. Davydov; Patric R.J. Östergård
- Book ID
- 102572866
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 123 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
✦ Synopsis
A new quaternary linear code of length 19, codimension 5, and covering radius 2 is found in a computer search using tabu search, a local search heuristic. Starting from this code, which has some useful partitioning properties, di!erent lengthening constructions are applied to get an in"nite family of new, record-breaking quaternary codes of covering radius 2 and odd codimension. An algebraic construction of covering codes over alphabets of even characteristic is also given.
📜 SIMILAR VOLUMES
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC
Honkla, I., All binary codes with covering radius one are subnormal, Discrete Mathematics 94 (1991) 229-232. We prove that if a binary code hat; covering radius one then it is subnormal.