Shortening Array Codes and the Perfect $1$-Factorization Conjecture

DOI10.1109/TIT.2008.2009850zbMath1367.94399OpenAlexW2174868851WikidataQ123127832 ScholiaQ123127832MaRDI QIDQ4975714

Jehoshua Bruck, Vasken Bohossian

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)

Related Items (2)

Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ Perfect one-factorizations arising from the Lee metric

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