The completion determination of optimal (3,4)-packings

DOI10.1007/S10623-014-0001-2zbMATH Open1328.05031arXiv1401.2022OpenAlexW2052484545MaRDI QIDQ499668FDOQ499668

Authors: Jingjun Bao, Lijun Ji 

Publication date: 30 September 2015

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

Abstract: A 3-$(n,4,1)$ packing design consists of an $n$-element set $X$ and a collection of $4$-element subsets of $X$, called {it blocks}, such that every $3$-element subset of $X$ is contained in at most one block. The packing number of quadruples $d(3,4,n)$ denotes the number of blocks in a maximum $3$-$(n,4,1)$ packing design, which is also the maximum number $A(n,4,4)$ of codewords in a code of length $n$, constant weight $4$, and minimum Hamming distance 4. In this paper the undecided 21 packing numbers $A(n,4,4)$ are shown to be equal to Johnson bound $J(n,4,4)$ $(=lfloorfracn4lfloorfracn-13lfloorfracn-22floorfloorfloor)$ where $n=6k+5$, $$ is odd, $$.

Full work available at URL: https://arxiv.org/abs/1401.2022

Recommendations

• Asymptotic determination of the last packing number of quadruples
• A \(3\)-\((v,4,1)\) packing construction
• scientific article; zbMATH DE number 3867360
• scientific article; zbMATH DE number 554186
• The last packing number of quadruples, and cyclic SQS

zbMATH Keywords

constant weight codepacking designcandelabra system\(s\)-fan design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Applications of design theory to circuits and networks (94C30)

Cites Work

• A general recursive construction for quadruple systems
• A class of three-designs
• The fundamental construction for 3-designs
• Subdesigns in Steiner quadruple systems
• On candelabra quadruple systems.
• On Quadruple Systems
• An improvement on H design
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Existence of Steiner quadruple systems with a spanning block design
• A new table of constant weight codes
• Asymptotic determination of the last packing number of quadruples
• Upper bounds for constant weight error correcting codes
• Title not available (Why is that?)

Cited In (21)

• Optimal ternary constant-composition codes with weight four and distance three
• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
• New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
• Improving bounds on packing densities of 4-point permutations
• On the existence of optimal \(n\)-dimensional cyclic packings.
• Suitable sets of permutations, packings of triples, and Ramsey's theorem
• Combinatorial constructions of optimal low-power error-correcting cooling codes
• Constructions of optimal two-dimensional optical orthogonal codes with AM-OPPW restriction for \(\lambda = 2\)
• Title not available (Why is that?)
• Combinatorial constructions of optimal \((m,n,4,2)\) optical orthogonal signature pattern codes
• Packing cliques in 3‐uniform hypergraphs
• Combinatorial constructions of repairable threshold schemes
• Optimal holey packings OHP₄(2, 4, n ,3)'s
• The last packing number of quadruples, and cyclic SQS
• Some new infinite classes of candelabra quadruple systems
• Determination of the packing number \(D_{\lambda }(3,W_4^{(3)},\nu )\)
• Well-balanced quadruple systems
• Two-weight codes: upper bounds and new optimal constructions
• A simple proof of the improved Johnson bound for binary codes
• A \(3\)-\((v,4,1)\) packing construction
• New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes

This page was built for publication: The completion determination of optimal \((3,4)\)-packings

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