Rank Distance Bicodes and Their Generalization
- ISBN-10
- 9185917125
- ISBN-13
- 9789185917129
- Category
- Coding theory
- Pages
- 150
- Language
- English
- Published
- 2010
- Publisher
- Infinite Study
- Authors
- W. B. Vasantha Kandasamy, Florentin Smarandache, N. Suresh Babu
Description
The new class of rank distance m-codes will be useful in the m-public key m-cryptosystems (m>1) and m-redundant array of inexpensive disks.AMRD-m-codes can be used in data multi (m)-storage systems. These m-codes provide an economical, time-saving alternative.
Get the book
Similar books
-
Rank Distance Bicodes and Their Generalization
Rank Distance Bicodes and Their Generalization
-
Encyclopedia of Neutrosophic Researchers, Vol. I
By Florentin SmarandacheISBN: 1-59973-030-8 Super Fuzzy Matrices and Super Fuzzy Models for Social Scientists, (with Florentin Smarandache and K. Amal) pp. 280, Info Learn Quest, Ann Arbor, USA. ISBN: 1-59973-0278 New Classes of Codes for Computer Scientists ...
-
Rings, Modules and Codes
By Christian Lomp, André Leroy, Sergio López-PermouthNote the size q of the alphabet Fq. There exist two generalizations of Reed-Solomon codes to skew polynomial rings: (1) In [3] ... A future project will be to generalize the notion of rank distance for the codes presented in this paper.
-
Network Coding and Subspace Designs
By Marcus Greferath, Mario Osvin Pavčević, Natalia SilbersteinElisa Gorla and Alberto Ravagnani Abstract We review the main results of the theory of error-correcting codes with ... endowed with the rank metric have been re-discovered for error correction in the context of linear network coding, ...
-
Codes and Algebraic Curves
By Oliver PretzelThere cannot be two distinct code words Vi, v2 of distance less than d/2 from a word u. ... problem in the design of error-correcting codes is to find codes with a large rank and minimum distance in relation to the block length.
-
Codes and Rings: Theory and Practice
By Patrick Solé, Minjia Shi, Adel AlahmadiCodes meeting this bound are called maximum distance separable (MDS). This bound is purely combinatorial since ... This bound takes into account the structure of the code and not simply its size or rank. Both bounds in [2] and [7] are a ...
-
Information, Coding and Mathematics: Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday
By Henk C.A. van Tilborg, Mario Blaum, Patrick G. FarrellBob McEliece on his 60th birthday Mario Blaum, Patrick G. Farrell, Henk C.A. van Tilborg. 1. Introduction Rank codes were ... These codes are a generalization of the family of rank product codes introduced and investigated in [8].
-
Green Communication in 4G Wireless Systems
By Shahid Mumtaz, Jonathan Rodrigueznetwork coding, and provided a brief definition of its metric and its link with rank-metric codes. ... The expression of the distance metric for lifted rank-metric codes becomes d(W(A), W(B)) = 2dR(A,B) d(W(C)) = dR(C) (7.15) which ...
-
Progress in Cryptology – AFRICACRYPT 2014: 7th International Conference on Cryptology in Africa, Marrakesh, Morocco, May 28-30, 2014. Proceedings
By David Pointcheval, Damien VergnaudWe refer to [22] for more details on codes for the rank distance. A rank code C of length n and dimension ... The matrix G denotes a k × n generator matrix of C and H one of its parity check matrix. At last, the notion of isometry which ...
-
Communications in Interference Limited Networks
By Wolfgang UtschickThis implies that there cannot exist a polynomial upper bound depending only on n and d as the Johnson bound for Hamming ... In [42] a lower bound for list decoding of Gabidulin codes of length n and minimum rank distance d was given, ...