EXPLICIT CODES WITH LOW COVERING RADIUS

被引:7
|
作者
PACH, J [1 ]
SPENCER, J [1 ]
机构
[1] SUNY STONY BROOK,DEPT MATH,STONY BROOK,NY 11794
关键词
Mathematical Techniques--Matrix Algebra - Probability--Game Theory;
D O I
10.1109/18.21258
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A series of explicit low-rate binary linear codes that have relatively low covering radius and can be rapidly decoded is exhibited. These codes can be derived from higher-dimensional analogs of the Gale-Berlekamp switching game. Conjectures of independent interest involving Hadamard matrices are given that could yield semiexplicit covering codes of very low density.
引用
收藏
页码:1281 / 1285
页数:5
相关论文
共 50 条