Binary Hamming codes and Boolean designs
From MaRDI portal
Publication:2034991
DOI10.1007/s10623-021-00853-zzbMath1466.05013OpenAlexW3156498719MaRDI QIDQ2034991
Publication date: 23 June 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00853-z
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)
Related Items (6)
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 ⋮ On the seven non-isomorphic solutions of the fifteen schoolgirl problem ⋮ On the subset sum problem for finite fields ⋮ Super-regular Steiner 2-designs ⋮ A new family of additive designs
Cites Work
- On the additivity of block designs
- Counting subset sums of finite Abelian groups
- On the subset sum problem over finite fields
- Designs over finite fields
- On 2-ranks of Steiner triple systems
- The subset sum problem for finite abelian groups
- Permutations of zero-sumsets in a finite vector space
- The group of permutation automorphisms of a \(q\)-ary Hamming code
- Designs over finite fields by difference methods
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Kirkman's Tetrahedron and the Fifteen Schoolgirl Problem
- On the Weight Distributions of Cosets of a Linear Code
- A lower bound on the number of Semi‐Boolean quadruple systems
- A formula for the number of Steiner quadruple systems on 2n points of 2‐rank 2n−n
- Perfect binary codes: constructions, properties, and enumeration
- Conway’s groupoid and its relatives
- Four fundamental parameters of a code and their combinatorial significance
- On automorphism groups of perfect binary codes and Steiner triple systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Binary Hamming codes and Boolean designs
