✦ LIBER ✦

Low-density MDS codes and factors of complete graphs

✍ Scribed by Lihao Xu; Bohossian, V.; Bruck, J.; Wagner, D.G.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Explicit constructions of graphs without

✍ G. A. Margulis 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 364 KB

Graph-theoretic construction of low-dens

✍ Djurdjevic, I.; Lin, S.; Abdel-Ghaffar, K. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 313 KB

Low-Density Graph Codes That Are Optimal

✍ Wainwright, M.J.; Martinian, E. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 1000 KB

On 4-semiregular 1-factorizations of com

✍ Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 304 KB

On the size of graphs with complete-fact

✍ Jin Akiyama; Peter Frankl 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

Factorizations of the Complete Graph int

✍ Peter Adams; Darryn Bryant; Saad I. El-Zanati; Heather Gavlas 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 347 KB