TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

On the weight distribution of perfect binary codes

*

* Corresponding author · click or hover a name for details

pp. 271–279Vol. 26Issue 1February 2021DOI: 10.1080/09720529.2021.1932898 Crossmark XML
Received:
30 Nov 2020
Published Online:
28 Oct 2021
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1360
Pages:
271–279

Abstract

In this paper, we give a new proof of the closed-form formula for the weight distribution of a perfect binary single-error-correcting code.

Keywords

Subject Classifications

(2010) 11T7194B2594B05

References

  1. A. CaggegiG. FalconeM. PavoneOn the additivity of block designsJ. Algebr. Comb. 45, 271-294 (2017). doi: https://doi.org/10.1007/s10801-016-0707-5 [Crossref][Web of Science ®][Google Scholar]
  2. A. CaggegiG. FalconeM. PavoneAdditivity of affine designsJ. Algebr. Comb. 53, 755-770 (2021). doi: https://doi.org/10.1007/s10801-020-00941-8 [Crossref][Web of Science ®][Google Scholar]
  3. T. EtzionA. VardyPerfect Binary Codes: Constructions, Properties, and EnumerationIEEE Trans. Inf. Theory 40 (3), 754-763 (1994). doi: https://doi.org/10.1109/18.335887 [Crossref][Web of Science ®][Google Scholar]
  4. G. FalconeM. PavonePermutations of zero-sumsets in a finite vector spaceForum Math. 33 (2), 349-359 (2021). doi: https://doi.org/10.1515/forum-2019-0228 [Crossref][Web of Science ®][Google Scholar]
  5. G. FalconeM. PavoneBinary Hamming codes and Boolean designsDes. Codes Cryptogr. 89, 1261-1277 (2021). doi: https://doi.org/10.1007/s10623-021-00853-z [Crossref][Web of Science ®][Google Scholar]
  6. J. LiD. WanOn the subset sum problem over finite fieldsFinite Fields Appl. 14 (4), 911-929 (2008). doi: https://doi.org/10.1016/j.ffa.2008.05.003 [Crossref][Web of Science ®][Google Scholar]
  7. F. J. MacWilliamsN. J. A. SloaneThe Theory of Error-Correcting CodesNorth-HollandNew York (1977). [Google Scholar]
  8. M. Pavone, Subset sums and block designs in a finite vector space (submitted). [Google Scholar]
  9. K. T. PhelpsA combinatorial construction of perfect codesSIAM J. Algebraic and Discrete Methods 4, 398-403 (1983). doi: https://doi.org/10.1137/0604040 [Crossref][Google Scholar]
  10. R. M. RothIntroduction to coding theoryCambridge University PressCambridge (2006). [Crossref][Google Scholar]
  11. H. S. ShapiroD. L. SlotnickOn the Mathematical Theory of Error- Correcting CodesIBM J. Res. Dev. 3 (1), 25-34 (1959). doi: https://doi.org/10.1147/rd.31.0025 [Crossref][Web of Science ®][Google Scholar]
  12. F. I. Solov’evaBinary nongroup codes (in Russian)Methody Discret. Analiz. 37, 65-76 (1981). [Google Scholar]
  13. J. L. Vasil’evOn nongroup close-packed codesProbl. Kibernet. 8, 375378 (in Russian) (1962). [Google Scholar]
Views: 129Downloads: 68Citations: 0