Shortening Array Codes and the Perfect 1-Factorization Conjecture

DOI10.1109/TIT.2008.2009850MaRDI QIDQ4975714zbMATH OpenOpenAlexWikidataFDO

Authors Vasken Bohossian, Jehoshua Bruck

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.2009850

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 1759416
• An alternative formulation of the factorization conjecture for codes
• A partial result about the factorization conjecture for finite variable- length codes
• On the factorization of codes
• scientific article; zbMATH DE number 2114221
• Shortened Linear Codes Over Finite Fields
• On perfect \(p\)-ary codes of length \(p+1\)
• scientific article; zbMATH DE number 1047910
• On the binary codes with parameters of doubly-shortened 1-perfect codes
• FINITE COMPLETIONS VIA FACTORIZING CODES

Cited in

(6)

• A partial result about the factorization conjecture for finite variable- length codes
• On the binary codes with parameters of doubly-shortened 1-perfect codes
• Perfect one-factorizations arising from the Lee metric
• Hypercube 1-factorizations from extended Hamming codes
• scientific article; zbMATH DE number 1759416 (Why is no real title available?)
• Cycles of quadratic Latin squares and antiperfect 1‐factorisations

This page was built for publication: Shortening Array Codes and the Perfect $1$-Factorization Conjecture

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