Recursive code construction for random networks

Authors:
Vitaly Skachek
Affiliations:
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore and Claude Shannon Institute and the School of Mathematical Sciences, U ...
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 7
Cited 4

Johnson type bounds on constant dimension codes

Designs, Codes and Cryptography
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams

IEEE Transactions on Information Theory
Constant-rank codes and their connection to constant-dimension codes

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear authentication codes: bounds and constructions

IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory

Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams

IEEE Transactions on Information Theory
Packing and covering properties of subspace codes for error control in random linear network coding

IEEE Transactions on Information Theory
Constant-rank codes and their connection to constant-dimension codes

IEEE Transactions on Information Theory
Rank subcodes in multicomponent network coding

Problems of Information Transmission

Quantified Score

Hi-index	755.02

Visualization

Abstract

A modification of Kötter-Kschischang codes for random networks is presented (these codes were also studied by Wang et al. in the context of authentication problems). The new codes have higher information rate, while maintaining the same error-correcting capabilities. An efficient error-correcting algorithm is proposed for these codes.