Metraipolis › archive › dc_8385735784ca
On the Minimum Field Size of Network MDS Codes for Generalized Combination Networks — arXiv:2608.03209
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03209
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:56:04.415Z
- SHA-256 of the archived text
769065b86a61fd2dddbb642f951f3fb709881f14519a4b821a517709c18675e6- Stable URL of this page
https://metraipolis.com/documento/dc_8385735784ca
How to cite
On the Minimum Field Size of Network MDS Codes for Generalized Combination Networks — arXiv:2608.03209 — arXiv (en), https://arxiv.org/abs/2608.03209 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8385735784ca (Metraipolis archive dc_8385735784ca, sha256 769065b86a61fd2dddbb642f951f3fb709881f14519a4b821a517709c18675e6)
BibTeX
@misc{dc8385735784ca,
title = {On the Minimum Field Size of Network MDS Codes for Generalized Combination Networks — arXiv:2608.03209},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03209},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8385735784ca; sha256 769065b86a61fd2dddbb642f951f3fb709881f14519a4b821a517709c18675e6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03209. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper investigates the minimum field size required for network maximum distance separable (MDS) codes, a critical parameter affecting computational complexity at network nodes. Focusing on generalized combination networks and Zosin Khuller networks, we develop a systematic framework for both scalar and vector network MDS codes. For scalar codes on generalized combination networks, we establish an equivalence between the minimum distance of network codes and the minimum Hamming distance of classical linear codes, converting network-level MDS constraints into coding theory conditions. This yields necessary and sufficient existence conditions linked to classical MDS codes and covering Grassmannian codes. Using refined greedy constructions and MRD code designs, we obtain improved bounds on the minimum field size, outperforming the prior universal bound. For vector network codes, we develop an analogous distance equivalence and characterize existence via covering Grassmannian codes, yielding bounds on the minimum effective field size. Notably, the gap between optimal scalar and vector MDS codes vanishes for several parameter regimes; we explicitly identify a family of such networks where vector coding offers no field size advantage over scalar coding. For Zosin Khuller networks, we derive lower bounds on the minimal effective field size of vector MDS codes using hypergraph homomorphisms and subset intersection arguments, strictly improving prior scalar bounds. We further provide a necessary and sufficient condition built upon hypergraph homomorphisms for vector MDS construction, yielding an upper bound on the minimum field size. Finally, we bound the MDS gap between optimal scalar and vector solutions. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2608.03209 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:43:52.294Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).