Pages that link to "Item:Q4838630"

The following pages link to Perfect binary codes: constructions, properties, and enumeration (Q4838630):

Displaying 46 items.

• Binary extended perfect codes of length 16 and rank 14 (Q415654) (← links)
• A note on the symmetry group of full rank perfect binary codes (Q449148) (← links)
• Linear maps of perfect codes and irregular \(C\)-partitions (Q482221) (← links)
• STS-graphs of perfect codes mod kernel (Q556834) (← links)
• Switching codes and designs (Q658111) (← links)
• The poset structures admitting the extended binary Hamming code to be a perfect code (Q704279) (← links)
• Enumerating and decoding perfect linear Lee codes (Q735017) (← links)
• To the theory of \(q\)-ary Steiner and other-type trades (Q897311) (← links)
• On perfect \(p\)-ary codes of length \(p+1\) (Q1008963) (← links)
• Generalized MacWilliams identities and their applications to perfect binary codes (Q1009104) (← links)
• Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components (Q1271418) (← links)
• Kernels of nonlinear Hamming codes (Q1904424) (← links)
• Binary Hamming codes and Boolean designs (Q2034991) (← links)
• On intersections of Reed-Muller like codes (Q2068824) (← links)
• On the number of \(q\)-ary quasi-perfect codes with covering radius 2 (Q2161415) (← links)
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph (Q2222928) (← links)
• On the subset sum problem for finite fields (Q2238923) (← links)
• On the size of the symmetry group of a perfect code (Q2275444) (← links)
• A family of group divisible designs with arbitrary block sizes (Q2279385) (← links)
• A new class of security oriented error correcting robust codes (Q2325296) (← links)
• Perfect codes in the discrete simplex (Q2339137) (← links)
• On non-full-rank perfect codes over finite fields (Q2414930) (← links)
• Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes (Q2430684) (← links)
• Local duality theorem for \(q\)-ary 1-perfect codes (Q2439732) (← links)
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. (Q2572990) (← links)
• On the binary codes with parameters of doubly-shortened 1-perfect codes (Q2638426) (← links)
• On full-rank perfect codes over finite fields (Q2959188) (← links)
• On the embedding of constant-weight codes into perfect codes (Q2959190) (← links)
• On enumeration of the perfect binary codes of length 15 (Q3148512) (← links)
• Bounds on the rank and kernel of perfect codes (Q3438987) (← links)
• Embedding in a perfect code (Q3578151) (← links)
• The Algebraic Degree of Perfect Binary Codes (Q3604851) (← links)
• On perfect binary arrays (Q4204162) (← links)
• On binary 1-perfect additive codes: some structural properties (Q4677579) (← links)
• (Q4866343) (← links)
• Local spectra of perfect binary codes (Q4936734) (← links)
• Construction of two- or three-weight binary linear codes from Vasil'ev codes (Q5001883) (← links)
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph (Q5264765) (← links)
• Involutions in Binary Perfect Codes (Q5272369) (← links)
• (Q5488372) (← links)
• Minimum supports of eigenfunctions of graphs: a survey (Q5888902) (← links)
• A survey of perfect codes (Q5900201) (← links)
• On perfect binary codes (Q5900372) (← links)
• Projective tilings and full-rank perfect codes (Q6050257) (← links)
• Optimal functions with spectral constraints in hypercubes (Q6177417) (← links)
• On nonlinear 1-quasi-perfect codes and their structural properties (Q6660008) (← links)