On the weight distribution of perfect binary codes
Author:
- 28 October 2021
- journal article
- research article
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (1) , 1-9
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
This publication has 9 references indexed in Scilit:
- Binary Hamming codes and Boolean designsDesigns, Codes and Cryptography, 2021
- Permutations of zero-sumsets in a finite vector spaceForum Mathematicum, 2020
- Additivity of affine designsJournal of Algebraic Combinatorics, 2020
- On the additivity of block designsJournal of Algebraic Combinatorics, 2016
- On the subset sum problem over finite fieldsFinite Fields and Their Applications, 2008
- Introduction to Coding Theory2006
- Perfect binary codes: constructions, properties, and enumerationIEEE Transactions on Information Theory, 1994
- A Combinatorial Construction of Perfect CodesSIAM Journal on Algebraic Discrete Methods, 1983
- On the Mathematical Theory of Error-Correcting CodesIBM Journal of Research and Development, 1959