On optimal binary codes with unbalanced coordinates

被引：4
|
作者：
Ostergard, Patric R. J. [1 ]
机构：
[1] Aalto Univ, Sch Elect Engn, Dept Commun & Networking, Aalto 00076, Finland
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2013年 / 24卷 / 3-4期
基金：
芬兰科学院;
关键词：
Balanced code; Bounds on codes; Classification; Code equivalence; Error-correcting code; Optimal code; ERROR-CORRECTING CODES; UPPER-BOUNDS; BALANCED CODES; FAMILY;
D O I：
10.1007/s00200-013-0189-9
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A coordinate of a binary code of size M is said to be balanced if the number of zero and ones in the coordinate is either or (that is, exactly for even M). Since good codes (of various types) tend to be balanced in all coordinates, various conjectures have been made regarding the existence of such codes. It is here shown that there are parameters for which there are no optimal binary error-correcting codes with a balanced coordinate. This is proved by the code attaining , which is shown to be unique here; denotes the maximum size of a binary code of length n and minimum distance d. It is further shown that .
引用
收藏
页码：197 / 200
页数：4
相关论文
共 50 条
  • [21] On locality of binary distance-optimal codes
    Ruipan Yang
    Ruihu Li
    Qiang Fu
    Sen Yang
    Yi Rao
    Cryptography and Communications, 2024, 16 : 49 - 69
  • [22] Binary MDS Array Codes With Optimal Repair
    Hou, Hanxu
    Lee, Patrick P. C.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (03) : 1405 - 1422
  • [23] A class of binary cyclic codes with optimal parameters
    Liu, Kaiqiang
    Wang, Qi
    Yan, Haode
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (03): : 663 - 675
  • [24] ON OPTIMAL CODES FOR BINARY ASYMMETRIC CHANNELS.
    Flatto, L.
    IEEE Transactions on Information Theory, 1986, IT-32 (06) : 695 - 696
  • [25] Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
    Fazeli, Arman
    Hassani, Hamed
    Mondelli, Marco
    Vardy, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (09) : 5693 - 5710
  • [26] Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels
    Fazeli, Arman
    Hassani, Hamed
    Mondelli, Marco
    Vardy, Alexander
    2018 IEEE INFORMATION THEORY WORKSHOP (ITW), 2018, : 395 - 399
  • [27] Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes
    Hu, Weihua
    Yamamoto, Hirosuke
    Honda, Junya
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (08) : 5074 - 5086
  • [28] Optimal Binary Switch Codes with Small Query Size
    Wang, Zhiying
    Kiah, Han Mao
    Cassuto, Yuval
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 636 - 640
  • [29] Rank-2-optimal binary spreading codes
    Karystinos, George N.
    Pados, Dimitris A.
    2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-4, 2006, : 1534 - 1539
  • [30] The number of optimal binary one-ended codes
    Kukorelly, Z
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 14 - 14
12345