Abstract:
This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2k with mutual distance d between code words. These bo...Show MoreMetadata
Abstract:
This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2k with mutual distance d between code words. These bounds are compared with previously known bounds, and are shown to improve upon them for certain ranges of k and d. Values of k and d are given for which one of these bounds can actually be achieved; in such cases, the structure of the resulting codes is shown to satisfy a certain condition.
Published in: IBM Journal of Research and Development ( Volume: 4, Issue: 5, November 1960)
DOI: 10.1147/rd.45.0532
Citations are not available for this document.
Cites in Papers - |
Cites in Papers - IEEE (93)
Select All
1.
Yansheng Wu, Bowen Li, Weibei Fan, Fu Xiao, "Two Infinite Families of Quaternary Codes", IEEE Transactions on Information Theory, vol.70, no.12, pp.8723-8733, 2024.
2.
Hao Chen, Conghui Xie, "A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions", IEEE Transactions on Information Theory, vol.70, no.12, pp.8713-8722, 2024.
3.
Qiang Fu, Ruipan Yang, Hao Song, Yuezhen Ren, "Four New Optimal Codes over F7 and F9", 2024 IEEE 16th International Conference on Advanced Infocomm Technology (ICAIT), pp.295-298, 2024.
4.
Minjia Shi, Shitao Li, Tor Helleseth, "The Weight Enumerator Polynomials of the Lifted Codes of the Projective Solomon-Stiffler Codes", IEEE Transactions on Information Theory, vol.70, no.9, pp.6316-6325, 2024.
5.
Gaojun Luo, Martianus Frederic Ezerman, Cem Güneri, San Ling, Ferruh Özbudak, "Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric", IEEE Transactions on Information Theory, vol.70, no.11, pp.7840-7847, 2024.
6.
Yang Li, Shixin Zhu, Edgar Martínez-Moro, "On ℓ-MDS Codes and a Conjecture on Infinite Families of 1-MDS Codes", IEEE Transactions on Information Theory, vol.70, no.10, pp.6899-6911, 2024.
7.
Vidya Sagar, Ritumoni Sarma, "Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes", IEEE Transactions on Information Theory, vol.70, no.5, pp.3373-3384, 2024.
8.
Gaojun Luo, Martianus Frederic Ezerman, San Ling, Buket Özkaya, "Improved Spectral Bound for Quasi-Cyclic Codes", IEEE Transactions on Information Theory, vol.70, no.6, pp.4002-4015, 2024.
9.
Hao Chen, Longjiang Qu, Chengju Li, Shanxiang Lyu, Liqing Xu, Mingshuo Zhou, "Generalized Singleton Type Upper Bounds", IEEE Transactions on Information Theory, vol.70, no.5, pp.3298-3308, 2024.
10.
René Rodríguez-Aldama, Enes Pasalic, Fengrong Zhang, Yongzhuang Wei, "Minimal p-Ary Codes via the Direct Sum of Functions, Non-Covering Permutations and Subspaces of Derivatives", IEEE Transactions on Information Theory, vol.70, no.6, pp.4445-4463, 2024.
11.
Zhao Hu, Yunge Xu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang, "New Constructions of Optimal Linear Codes From Simplicial Complexes", IEEE Transactions on Information Theory, vol.70, no.3, pp.1823-1835, 2024.
12.
Shitao Li, Minjia Shi, "Characterization and Classification of Binary Linear Codes With Various Hull Dimensions From an Improved Mass Formula", IEEE Transactions on Information Theory, vol.70, no.5, pp.3357-3372, 2024.
13.
Cem Güneri, "Optimal Binary Linear Complementary Pairs From Solomon-Stiffler Codes", IEEE Transactions on Information Theory, vol.69, no.10, pp.6512-6517, 2023.
14.
Carl Riehm, Christoph Frisch, Florin Burcea, Matthias Hiller, Michael Pehl, Ralf Brederlow, "Structured Design and Evaluation of a Resistor-Based PUF Robust Against PVT-Variations", 2023 26th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS), pp.93-98, 2023.
15.
Sihem Mesnager, Liqin Qian, Xiwang Cao, Mu Yuan, "Several Families of Binary Minimal Linear Codes From Two-to-One Functions", IEEE Transactions on Information Theory, vol.69, no.5, pp.3285-3301, 2023.
16.
Jon-Lark Kim, Whan-Hyuk Choi, "Self-Orthogonality Matrix and Reed-Muller Codes", IEEE Transactions on Information Theory, vol.68, no.11, pp.7159-7164, 2022.
17.
Zhao Hu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang, "A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields", IEEE Transactions on Information Theory, vol.68, no.7, pp.4408-4421, 2022.
18.
Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden, "An Algorithmic Reduction Theory for Binary Codes: LLL and More", IEEE Transactions on Information Theory, vol.68, no.5, pp.3426-3444, 2022.
19.
Yansheng Wu, Chengju Li, Fu Xiao, "Quaternary Linear Codes and Related Binary Subfield Codes", IEEE Transactions on Information Theory, vol.68, no.5, pp.3070-3080, 2022.
20.
Gaojun Luo, Xiwang Cao, "Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes", IEEE Transactions on Communications, vol.69, no.8, pp.4987-4997, 2021.
21.
Jon-Lark Kim, Young-Hun Kim, Nari Lee, "Embedding Linear Codes Into Self-Orthogonal Codes and Their Optimal Minimum Distances", IEEE Transactions on Information Theory, vol.67, no.6, pp.3701-3707, 2021.
22.
Xiaoxiao Li, Minjia Shi, "A New Family of Optimal Binary Few-Weight Codes From Simplicial Complexes", IEEE Communications Letters, vol.25, no.4, pp.1048-1051, 2021.
23.
Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh, "Bounds and Code Constructions for Partially Defect Memory Cells", 2020 Algebraic and Combinatorial Coding Theory (ACCT), pp.1-7, 2020.
24.
Rumen Daskalov, Elena Metodieva, "Three new large (n, r) arcs in PG(2,31)", 2020 Algebraic and Combinatorial Coding Theory (ACCT), pp.1-4, 2020.
25.
Hong Lu, Shudi Yang, "Two Classes of Linear Codes From Weil Sums", IEEE Access, vol.8, pp.180471-180480, 2020.
26.
Ziling Heng, Qiuyan Wang, Cunsheng Ding, "Two Families of Optimal Linear Codes and Their Subfield Codes", IEEE Transactions on Information Theory, vol.66, no.11, pp.6872-6883, 2020.
27.
Yansheng Wu, Yoonjin Lee, "Binary LCD Codes and Self-Orthogonal Codes via Simplicial Complexes", IEEE Communications Letters, vol.24, no.6, pp.1159-1162, 2020.
28.
Yanan Wu, Nian Li, Xiangyong Zeng, "Linear Codes From Perfect Nonlinear Functions Over Finite Fields", IEEE Transactions on Communications, vol.68, no.1, pp.3-11, 2020.
29.
Xiaomeng Zhu, Yansheng Wu, Qin Yue, "New Quaternary Codes Derived from Posets of the Disjoint Union of Two Chains", IEEE Communications Letters, vol.24, no.1, pp.20-24, 2020.
30.
Yansheng Wu, Xiaomeng Zhu, Qin Yue, "Optimal Few-Weight Codes From Simplicial Complexes", IEEE Transactions on Information Theory, vol.66, no.6, pp.3657-3663, 2020.
Cites in Papers - Other Publishers (177)
1.
Simeon Ball, Michel Lavrauw, Tabriz Popatia, "Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes", Designs, Codes and Cryptography, 2024.
2.
René Rodríguez-Aldama, "Few-weight linear codes over Fp from t-to-one mappings", Finite Fields and Their Applications, vol.100, pp.102510, 2024.
3.
Yanhui Zhang, Li Liu, Lanqiang Li, "A class of BCH codes of length $ n = \\\\frac{q^m-1}{4} $", Advances in Mathematics of Communications, vol.0, no.0, pp.0, 2024.
4.
Hongwei Liu, Zihao Yu, "Linear codes from simplicial complexes over $${\\\\mathbb {F}}_{2^n}$$", Designs, Codes and Cryptography, 2024.
5.
Jing Qiu, Fang-Wei Fu, "Some new constructions of optimal linear codes and alphabet-optimal $$(r,\\\\delta )$$-locally repairable codes", Designs, Codes and Cryptography, 2024.
6.
Dr. Mohammed Ibrahim, Islam, "Large (k,3)-arcs in PG(2,19) and the related linear codes", Journal of Kufa for Mathematics and Computer, vol.11, no.1, pp.43, 2024.
7.
Hongwei Zhu, Minjia Shi, "The b-symbol weight hierarchy of the Kasami codes", Discrete Mathematics, vol.347, no.2, pp.113774, 2024.
8.
Zoran Stanić, "Linear ternary codes of strongly regular signed graphs", Discrete Mathematics, vol.347, no.1, pp.113714, 2024.
9.
Turki Alsuraiheed, Elif Segah Oztas, Shakir Ali, Merve Bulut Yilgor, "Reversible codes and applications to DNA codes over $ F_{4^{2t}}[u]/(u^2-1) $", AIMS Mathematics, vol.8, no.11, pp.27762, 2023.
10.
Gaojun Luo, Martianus Frederic Ezerman, Markus Grassl, San Ling, "Constructing quantum error-correcting codes that require a variable amount of entanglement", Quantum Information Processing, vol.23, no.1, 2023.
11.
Christoph Frisch, Florian Wilde, Thomas Holzner, Michael Pehl, "A Practical Approach to Estimate the Min-Entropy in PUFs", Journal of Hardware and Systems Security, 2023.
12.
Vidya Sagar, Ritumoni Sarma, "Certain binary minimal codes constructed using simplicial complexes", Advances in Mathematics of Communications, vol.0, no.0, pp.0, 2023.
13.
Vidya Sagar, Ritumoni Sarma, "Minimal and optimal binary codes obtained using $$C_D$$-construction over the non-unital ring I", Designs, Codes and Cryptography, 2023.
14.
Yingjie Cheng, Xiwang Cao, Gaojun Luo, "Three new constructions of optimal linear codes with few weights", Computational and Applied Mathematics, vol.42, no.7, 2023.
15.
Yucong He, Sihem Mesnager, Nian Li, Lisha Wang, Xiangyong Zeng, "Several classes of linear codes with few weights over finite fields", Finite Fields and Their Applications, vol.92, pp.102304, 2023.
16.
Sascha Kurz, Ivan Landjev, Francesco Pavese, Assia Rousseva, "The geometry of $$(t\mod q)$$-arcs", Designs, Codes and Cryptography, 2023.
17.
Haider Al Kim, Sven Puchinger, Ludo Tolhuizen, Antonia Wachter-Zeh, "Coding and bounds for partially defective memory cells", Designs, Codes and Cryptography, 2023.
18.
Xianhong Xie, Yi Ouyang, Ming Mao, "Vectorial bent functions and linear codes from quadratic forms", Cryptography and Communications, 2023.
19.
Sihem Mesnager, Liqin Qian, Xiwang Cao, "Two families of few-weight codes over a finite chain ring", Discrete Mathematics, vol.346, no.7, pp.113464, 2023.
20.
Sen Wang, Yi Ouyang, Xianhong Xie, "A unified construction of optimal and distance optimal two or three-weight codes", Journal of Applied Mathematics and Computing, 2023.
21.
Canze Zhu, Qunying Liao, "Two new classes of projective two-weight linear codes", Finite Fields and Their Applications, vol.88, pp.102186, 2023.
22.
Zhao Hu, Bing Chen, Nian Li, Xiangyong Zeng, "Two Classes of Optimal Few-Weight Codes Over $${\mathbb F}_{q}+u{\mathbb F}_{q}$$", Arithmetic of Finite Fields, vol.13638, pp.208, 2023.
23.
Vidya Sagar, Ritumoni Sarma, "Octanary linear codes using simplicial complexes", Cryptography and Communications, 2022.
24.
Daiki Kawabata, Tatsuya Maruta, "On the nonexistence of ternary linear codes attaining the Griesmer bound", Designs, Codes and Cryptography, vol.90, no.4, pp.947, 2022.
25.
Shukai Wang, Minjia Shi, "Few-weight $${\pmb {{\mathbb {Z}}}}_p\pmb {{\mathbb {Z}}}_p[u]$$-additive codes from down-sets", Journal of Applied Mathematics and Computing, vol.68, no.4, pp.2381, 2022.
26.
Yansheng Wu, Jong Yoon Hyun, Qin Yue, "Optimal binary linear codes from posets of the disjoint union of two chains", Advances in Mathematics of Communications, vol.16, no.4, pp.1051, 2022.
27.
Xiangdong Cheng, Xiwang Cao, Liqin Qian, "Constructing few-weight linear codes and strongly regular graphs", Discrete Mathematics, vol.345, no.12, pp.113101, 2022.
28.
Wei Qi, "On the polycyclic codes over $ \mathbb{F}_q+u\mathbb{F}_q $", Advances in Mathematics of Communications, vol.0, no.0, pp.0, 2022.
29.
Xiaoxiao Li, Minjia Shi, "New classes of binary few weight codes from trace codes over a chain ring", Journal of Applied Mathematics and Computing, vol.68, no.3, pp.1869, 2022.
30.
Ziling Heng, Dexiang Li, Fenjin Liu, Weiqiong Wang, "Infinite families of $ t $-designs and strongly regular graphs from punctured codes", Advances in Mathematics of Communications, vol.16, no.4, pp.753, 2022.
