Computer Science – Information Theory
Scientific paper
2010-01-13
Computer Science
Information Theory
6 pages, 4 figures. Replaced the extended injection distance (and doubtful unproven statements about it) with the extended sub
Scientific paper
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.
Nobrega Roberto W.
Uchoa-Filho Bartolomeu F.
No associations
LandOfFree
Multishot Codes for Network Coding using Rank-Metric Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multishot Codes for Network Coding using Rank-Metric Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multishot Codes for Network Coding using Rank-Metric Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-524532