On decoding of DVR-based linear network codes

From MaRDI portal
Publication:893345

DOI10.1007/S00200-015-0264-5zbMATH Open1343.94091arXiv1409.0599OpenAlexW1570493435MaRDI QIDQ893345FDOQ893345

Shuo-Yen Robert Li, Qifu Tyler Sun

Publication date: 19 November 2015

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: The conventional theory of linear network coding (LNC) is only over acyclic networks. Convolutional network coding (CNC) applies to all networks. It is also a form of LNC, but the linearity is w.r.t. the ring of rational power series rather than the field of data symbols. CNC has been generalized to LNC w.r.t. any discrete valuation ring (DVR) in order for flexibility in applications. For a causal DVR-based code, all possible source-generated messages form a free module, while incoming coding vectors to a receiver span the emph{received submodule}. An existing emph{time-invariant decoding} algorithm is at a delay equal to the largest valuation among all invariant factors of the received submodule. This intrinsic algebraic attribute is herein proved to be the optimal decoding delay. Meanwhile, emph{time-variant decoding} is formulated. The meaning of time-invariant decoding delay gets a new interpretation through being a special case of the time-variant counterpart. The optimal delay turns out to be the same for time-variant decoding, but the decoding algorithm is more flexible in terms of decodability check and decoding matrix design. All results apply, in particular, to CNC.


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




Recommendations




Cites Work






This page was built for publication: On decoding of DVR-based linear network codes

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