Multishot Codes for Network Coding Using Rank-Metric Codes

The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a previous work we proposed a general construction of multishot code...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Wireless Network Coding Conference pp. 1 - 6
Main Authors Nóbrega, Roberto W, Uchôa-Filho, Bartolomeu F
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 01.06.2010
Subjects
Block codes
Concatenated codes
Decoding
Error correction codes
Extraterrestrial measurements
Modular construction
Modulation coding
Network coding
Network topology
Sections
Online AccessGet full text
ISBN1424479789
9781424479788
DOI10.1109/WINC.2010.5507933

Cover

More Information
Summary:The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a previous work we proposed a general construction of multishot codes for this channel based on the multilevel coding theory. Herein we apply this construction to the rank-metric space, obtaining multishot rank-metric codes which, by lifting, can be converted to codes for the aforementioned channel. We also adapt well-known encoding and decoding algorithms to the considered situation.
ISBN:1424479789
9781424479788
DOI:10.1109/WINC.2010.5507933