On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound
Open Access
- 3 December 2022
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 10 (23), 4588
- https://doi.org/10.3390/math10234588
Abstract
Bounds for the parameters of codes are very important in coding theory. The Grey–Rankin bound refers to the cardinality of a self-complementary binary code. Codes meeting this bound are associated with families of two-weight codes and other combinatorial structures. We study the relations among six infinite families of binary linear codes with two and three nonzero weights that are closely connected to the self-complementary linear codes meeting the Grey–Rankin bound. We give a construction method and partial classification results for such codes. The properties of the codes in the studied families and their relations help us in constructing codes of a higher dimension from codes with a given dimension.Keywords
Funding Information
- Bulgarian National Science Fund (KP-06-N32/2-2019, KP-06-Russia/33/17.12.2020)
- Bulgarian Ministry of Education and Science (DO1-168/28.07.2022)
This publication has 18 references indexed in Scilit:
- On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designsProblems of Information Transmission, 2007
- Projective two-weight codes with small parameters and their corresponding graphsDesigns, Codes and Cryptography, 2006
- Codes of lengths 120 and 136 meeting the Grey-Rankin bound and quasi-symmetric designsIEEE Transactions on Information Theory, 1999
- The uniformly packed binary [27,21,3] and [35,29,3] codesDiscrete Mathematics, 1996
- On the [28, 7, 12] binary self-complementary codes and their residualsDesigns, Codes and Cryptography, 1994
- The Geometry of Two-Weight CodesBulletin of the London Mathematical Society, 1986
- Weights of linear codes and strongly regular normed spacesDiscrete Mathematics, 1972
- Some bounds for error-correcting codesIEEE Transactions on Information Theory, 1962
- On the minimal points of positive definite quadratic formsMathematika, 1956
- The Closest Packing of Spherical Caps in n DimensionsProceedings of the Glasgow Mathematical Association, 1955