Binary codes from subset inclusion matrices

DOI10.1002/JCD.22012MaRDI QIDQ6879640zbMATH OpenFDO

Authors Alexey D. Marin, Ivan Yu. Mogilnykh

Publication date 29 December 2025

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JCD.22012

zbMATH Keywords

binary designcombinatorial designinclusion matrixminimum distance

Mathematics Subject Classification ID

Other designs, configurations (05B30) Linear programming (90C05) Integer programming (90C10) Linear codes (general theory) (94B05)

Cites work

• A diagonal form for the incidence matrices of t-subsets vs. k- subsets
• Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
• Codes from the incidence matrices of graphs on 3-sets
• scientific article; zbMATH DE number 3275093 (Why is no real title available?)
• scientific article; zbMATH DE number 6541785 (Why is no real title available?)
• Linear codes from projective spaces
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Modern Coding Theory
• On set systems with restricted intersections modulo p and p-ary t-designs
• Projective geometric codes
• The Magma algebra system. I: The user language
• Universal p‐ary designs

This page was built for publication: Binary codes from subset inclusion matrices

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