Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets

DOI10.1109/TIT.2017.2697421zbMATH Open1390.94674arXiv1608.01738OpenAlexW2477854368MaRDI QIDQ4566633FDOQ4566633

Authors: Joseph Connelly, Kenneth Zeger 

Publication date: 27 June 2018

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

Abstract: Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution over some finite commutative ring, then (i) the network is also scalar linearly solvable over a maximal commutative ring of the same size, and (ii) the (unique) smallest size commutative ring over which the network has a scalar linear solution is a field. We prove that a commutative ring is maximal with respect to the quasi-order if and only if some network is scalar linearly solvable over the ring but not over any other commutative ring of the same size. Furthermore, we show that maximal commutative rings are direct products of certain fields specified by the integer partitions of the prime factor multiplicities of the maximal ring's size. Finally, we prove that there is a unique maximal commutative ring of size $m$ if and only if each prime factor of $m$ has multiplicity in $1,2,3,4,6$. In fact, whenever $p$ is prime and $kin1,2,3,4,6$, the unique such maximal ring of size $p^k$ is the field $GF(p^k)$. However, for every field $GF(p^k)$ with $kotin1,2,3,4,6$, there is always some network that is not scalar linearly solvable over the field but is scalar linearly solvable over a commutative ring of the same size. These results imply that for scalar linear network coding over commutative rings, fields can always be used when the alphabet size is flexible, but alternative rings may be needed when the alphabet size is fixed.

Full work available at URL: https://arxiv.org/abs/1608.01738

Recommendations

• Linear Network Coding Over Rings – Part II: Vector Codes and Non-Commutative Alphabets
• Linear network codes based on \(R\)-modules
• Network Coding Theory Via Commutative Algebra
• Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets
• A commutative algebra approach to linear codes
• An introduction to ring-linear coding theory
• Algebraic Coding Theory Over Finite Commutative Rings
• Notes on linear codes over finite commutative chain rings
• On the linear codes over the ring \(R_p\)
• Linear complementary pairs of codes over rings

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (2)

• Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
• Matrix graphs and MRD codes over finite principal ideal rings

This page was built for publication: Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets

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