New Results on Codes with Covering Radius 1 and Minimum Distance 2

被引:0
作者
Patric R. J. Östergård
Jörn Quistorff
Alfred Wassermann
机构
[1] Helsinki University of Technology,Department of Electrical and Communications Engineering
[2] Helsinki University of Technology,Department of Mathematics
[3] University of Bayreuth,undefined
来源
Designs, Codes and Cryptography | 2005年 / 35卷
关键词
Data Structure; Information Theory; Minimum Distance; Discrete Geometry; Additional Requirement;
D O I
暂无
中图分类号
学科分类号
摘要
The minimal cardinality of a q-ary code of length n and covering radius at most R is denoted by Kq(n, R); if we have the additional requirement that the minimum distance be at least d, it is denoted by Kq(n, R, d). Obviously, Kq(n, R, d) ≥ Kq(n, R). In this paper, we study instances for which Kq(n,1,2) > Kq(n, 1) and, in particular, determine K4(4,1,2)=28 > 24=K4(4,1).
引用
收藏
页码:241 / 250
页数:9
相关论文
共 28 条
  • [1] Brouwer A. E.(1998)Bounds on mixed binary/ternary codes IEEE Transactions on Information Theory 44 140-161
  • [2] Hämäläinen H. O.(2001)On codes with covering radius 1 and minimum distance 2 Indagationes Mathematical (New Series) 12 449-452
  • [3] Östergåard P. R. J.(1967)The football pool problem for 5 matches Journal of Combinatorial Theory 3 315-325
  • [4] Sloane NKA(1998)Isomorph-free exhaustive generation Journal of Algorithms 26 306-324
  • [5] Blokhuis A.(2001)On the size of optimal binary codes of length 9 and covering radius 1 IEEE Transactions of Information Theory 47 2556-2557
  • [6] Egner S.(2002)A new lower bound for the football pool problem for 6 matches Journal of Combinatorial Theory Series A 99 175-179
  • [7] Hollmann H. D. L.(2000)Classification of binary covering codes Journal of Combinatorial Designs 8 391-401
  • [8] van Lint J. H.(1999)On full partial quasigroups of finite order and local cardinal maximum codes Beiträge zur Algebra und Geometrie 40 495-502
  • [9] Kamps H. J. L.(2001)On codes with given minimum distance and covering radius Beiträge zur Algebra und Geometrie 42 601-611
  • [10] van Lint J. H.(1969)Covering theorems for vectors with special reference to the case of four and five components Journal of the London Mathematical Society (2) 1 493-499