Galois geometries and coding theory
T Etzion, L Storme - Designs, Codes and Cryptography, 2016 - Springer
Galois geometries and coding theory are two research areas which have been interacting
with each other for many decades. From the early examples linking linear MDS codes with …
with each other for many decades. From the early examples linking linear MDS codes with …
Coding for errors and erasures in random network coding
R Koetter, FR Kschischang - IEEE Transactions on Information …, 2008 - ieeexplore.ieee.org
The problem of error-control in random linear network coding is considered. A “noncoherent”
or “channel oblivious” model is assumed where neither transmitter nor receiver is assumed …
or “channel oblivious” model is assumed where neither transmitter nor receiver is assumed …
A rank-metric approach to error control in random network coding
D Silva, FR Kschischang… - IEEE transactions on …, 2008 - ieeexplore.ieee.org
The problem of error control in random linear network coding is addressed from a matrix
perspective that is closely related to the subspace perspective of KÖtter and Kschischang. A …
perspective that is closely related to the subspace perspective of KÖtter and Kschischang. A …
Error-correcting codes in projective space
The projective space of order n over the finite field\BBF q, denoted here as Pq (n), is the set
of all subspaces of the vector space\BBF qn. The projective space can be endowed with the …
of all subspaces of the vector space\BBF qn. The projective space can be endowed with the …
[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
A coding theory construction of new systematic authentication codes
C Ding, X Wang - Theoretical computer science, 2005 - Elsevier
There are several approaches to the construction of authentication codes without secrecy
using error correcting codes. In this paper, we describe one approach and construct several …
using error correcting codes. In this paper, we describe one approach and construct several …
Rank-metric codes and their applications
The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …
Codes designed for the rank metric have attracted considerable attention in recent years …
Codes and designs related to lifted MRD codes
T Etzion, N Silberstein - IEEE Transactions on Information …, 2012 - ieeexplore.ieee.org
Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are
considered. It is shown that a lifted MRD code can be represented in such a way that it forms …
considered. It is shown that a lifted MRD code can be represented in such a way that it forms …
A generic construction of Cartesian authentication codes
C Ding, T Helleseth, T Klove… - IEEE transactions on …, 2007 - ieeexplore.ieee.org
In this paper, a coding-theory construction of Cartesian authentication codes is presented.
The construction is a generalization of some known constructions. Within the framework of …
The construction is a generalization of some known constructions. Within the framework of …
List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound
V Guruswami, C Xing - Proceedings of the forty-fifth annual ACM …, 2013 - dl.acm.org
We consider Reed-Solomon (RS) codes whose evaluation points belong to a subfield, and
give a linear-algebraic list decoding algorithm that can correct a fraction of errors …
give a linear-algebraic list decoding algorithm that can correct a fraction of errors …