Binary Hamming codes and Boolean designs

DOI10.1007/S10623-021-00853-ZMaRDI QIDQ2034991zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 23 June 2021

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10623-021-00853-z

zbMATH Keywords

block designsHamming codespermutation automorphismssubset sum problemweight distribution

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes and caps in Galois spaces (51E22) Linear codes (general theory) (94B05)

Recommendations

• Codes, designs and groups from the Hamming graphs
• scientific article; zbMATH DE number 4029438
• scientific article; zbMATH DE number 3948285
• Parameters of 2-designs from some BCH codes
• The group of permutation automorphisms of a q-ary Hamming code

Cites work

• A formula for the number of Steiner quadruple systems on 2ⁿ points of 2‐rank 2ⁿ−n
• A lower bound on the number of Semi‐Boolean quadruple systems
• Conway's groupoid and its relatives
• Designs over finite fields
• Designs over finite fields by difference methods
• Existence of q-analogs of Steiner systems
• Four fundamental parameters of a code and their combinatorial significance
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3627058 (Why is no real title available?)
• scientific article; zbMATH DE number 1284430 (Why is no real title available?)
• scientific article; zbMATH DE number 1382770 (Why is no real title available?)
• Kirkman's tetrahedron and the fifteen schoolgirl problem
• On 2-ranks of Steiner triple systems
• On automorphism groups of perfect binary codes and Steiner triple systems
• On the additivity of block designs
• On the subset sum problem over finite fields
• On the Weight Distributions of Cosets of a Linear Code
• Perfect binary codes: constructions, properties, and enumeration
• Permutations of zero-sumsets in a finite vector space
• Reconstruction theorems for centered functions and perfect codes
• Some additive 2-(v, 5,) designs
• Steiner systems from binary codes
• The CRC handbook of combinatorial designs
• The group of permutation automorphisms of a q-ary Hamming code
• The subset sum problem for finite abelian groups

Cited in

(20)

• Super-regular Steiner 2-designs
• On the subset sum problem for finite fields
• On the seven non-isomorphic solutions of the fifteen schoolgirl problem
• scientific article; zbMATH DE number 3948285 (Why is no real title available?)
• scientific article; zbMATH DE number 4029438 (Why is no real title available?)
• scientific article; zbMATH DE number 1330385 (Why is no real title available?)
• Codes, designs and groups from the Hamming graphs
• A new family of additive designs
• A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
• Subset sums and block designs in a finite vector space
• Heffter spaces
• Additivity of symmetric and subspace 2-designs
• Intersection of Hamming codes avoiding Hamming subcodes
• (27, 6, 5) designs with a nice automorphism group
• Shiftable Heffter spaces
• An algebraic representation of Steiner triple systems of order 13
• Additive combinatorial designs
• More Heffter spaces via finite fields
• \(\mathrm{EA}(q)\)-additive Steiner 2-designs
• Binary codes and quasi-symmetric designs

This page was built for publication: Binary Hamming codes and Boolean designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034991)