Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 2/2018

31-03-2017

Concatenation of convolutional codes and rank metric codes for multi-shot network coding

Authors: D. Napp, R. Pinto, V. Sidorenko

Published in: Designs, Codes and Cryptography | Issue 2/2018

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper we present a novel coding approach to deal with the transmission of information over a network. In particular we make use of the network several times (multi-shot) and impose correlation in the information symbols over time. We propose to encode the information via an inner and an outer code, namely, a Hamming metric convolutional code as an outer code and a rank metric code as an inner code. We show how this simple concatenation scheme can exploit the potential of both codes to produce a code that can correct a large number of error patterns.
previous article MDS 2D convolutional codes with optimal 1D horizontal projections
next article Extension of Overbeck’s attack for Gabidulin-based cryptosystems
Literature
1.
Almeida P., Napp D., Pinto R.: A new class of superregular matrices and MDP convolutional codes. Linear Algebr. Appl. 439(7), 2145–2157 (2013).MathSciNetCrossRefMATH
2.
Almeida P., Napp D., Pinto R.: Superregular matrices and applications to convolutional codes. Linear Algebr. Appl. 499, 1–25 (2016).MathSciNetCrossRefMATH
3.
Badr A., Khisti A., Tan W.T., Apostolopoulos J.: Layered constructions for low-delay streaming codes. IEEE Trans. Inform. Theory (2013). arXiv:​1308.​3827v1.
4.
Climent J., Napp D., Perea C., Pinto R.: Maximum distance separable 2D convolutional codes. IEEE Trans. Inform. Theory 62(2), 669–680 (2016).MathSciNetCrossRefMATH
5.
Climent J., Napp D., Pinto R., Simões R.: Decoding of \(2{D}\) convolutional codes over the erasure channel. Adv. Math. Commun. 10(1), 179–193 (2016).MathSciNetCrossRefMATH
6.
Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Combin. Theory Ser. A 25(3), 226–241 (1978).MathSciNetCrossRefMATH
7.
8.
Gluesing-Luerssen H., Rosenthal J., Smarandache R.: Strongly MDS convolutional codes. IEEE Trans. Inform. Theory 52(2), 584–598 (2006).MathSciNetCrossRefMATH
9.
Guo W., Shi X., Cai N., Medard M.: Localized dimension growth: a convolutional random network coding approach to managing memory and decoding delay. IEEE Trans. Commun. 61(9), 3894–3905 (2013).CrossRef
10.
11.
Hutchinson R., Rosenthal J., Smarandache R., Trumpf J.: Convolutional codes with maximum distance profile. Syst. Control Lett. 54(1), 53–63 (2005).
12.
Johannesson R., Zigangirov K.S.: Fundamentals of Convolutional Coding. IEEE Press, New York (1999).CrossRefMATH
13.
Kötter R., Kschischang F.: Coding for errors and erasures in random network coding. IEEE Trans. Inform. Theory 54(8), 3579–3591 (2008).MathSciNetCrossRefMATH
14.
MacWilliams F.J., Sloane N.J.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977).MATH
15.
16.
Mahmood R., Badr A., Khisti A.: Streaming-codes for multicast over burst erasure channels. IEEE Trans. Inform. Theory 61(8), 4181–4208 (2015).MathSciNetCrossRefMATH
17.
18.
McEliece R.J.: The algebraic theory of convolutional codes. In: Pless V., Huffman W. (eds.) Handbook of Coding Theory, vol. 1, pp. 1065–1138. Elsevier Science Publishers, Amsterdam (1998).
19.
Napp D., Smarandache R.: Constructing strongly MDS convolutional codes with maximum distance profile. Adv. Math. Commun. 10(2), 275–290 (2016).MathSciNetCrossRefMATH
20.
Napp D., Pinto R., Rosenthal J., Vettori P.: Rank metric convolutional codes. In: Proceedings of the 22nd International Symposium on Mathematical Theory of Network and Systems (MTNS), Minnesota, USA (2016).
21.
22.
Nóbrega R., Uchoa-Filho B.: Multishot codes for network coding using rank-metric codes. In: IEEE Wireless Network Coding Conference (WiNC), pp. 1–6 (2010).
23.
24.
Prasad K., Rajan B.S.: Network error correction for unit-delay, memory-free networks using convolutional codes. IEEE Int. Conf. Commun. 2010, 1–6 (2010).
25.
Rosenthal J.: Connections between linear systems and convolutional codes. In: Marcus B., Rosenthal J. (eds.) Codes, Systems and Graphical Models, IMA, vol. 123, pp. 39–66. Springer, New York (2001).CrossRef
26.
Rosenthal J., Smarandache R.: Maximum distance separable convolutional codes. Appl. Algebr. Eng. Commun. Comput. 10(1), 15–32 (1999).MathSciNetCrossRefMATH
27.
Rosenthal J., York E.V.: BCH convolutional codes. IEEE Trans. Autom. Control 45(6), 1833–1844 (1999).MathSciNetMATH
28.
Silva D., Kötter R., Kschischang F.: A rank-metric approach to error control in random network coding. IEEE Trans. Inform. Theory 54(9), 3951–3967 (2008).MathSciNetCrossRefMATH
29.
Tomas V., Rosenthal J., Smarandache R.: Decoding of convolutional codes over the erasure channel. IEEE Trans. Inform. Theory 58(1), 90–108 (2012).MathSciNetCrossRefMATH
30.
31.
Wachter-Zeh A., Stinner M., Sidorenko V.: Convolutional codes in rank metric with application to random network coding. IEEE Trans. Inform. Theory 61(6), 3199–3213 (2015).MathSciNetCrossRefMATH
Metadata
Title
Concatenation of convolutional codes and rank metric codes for multi-shot network coding
Authors
D. Napp
R. Pinto
V. Sidorenko
Publication date
31-03-2017
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 2/2018
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-017-0346-4

Other articles of this Issue 2/2018

Designs, Codes and Cryptography 2/2018 Go to the issue

OriginalPaper

Anticode-based locally repairable codes with high availability

OriginalPaper

Coding for locality in reconstructing permutations

OriginalPaper

On the genericity of maximum rank distance and Gabidulin codes

OriginalPaper

A new series of large sets of subspace designs over the binary field

EditorialNotes

Preface to the special issue on network coding and designs

OriginalPaper

Message encoding and retrieval for spread and cyclic orbit codes

Premium Partner

    Image Credits