X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
decoding (55) 55
rank-metric codes (48) 48
network coding (45) 45
engineering, electrical & electronic (44) 44
computer science, information systems (40) 40
codes (39) 39
rank metric (38) 38
information theory (37) 37
gabidulin codes (36) 36
mathematics, applied (35) 35
measurement (34) 34
computer science (32) 32
mathematics (32) 32
error-correcting codes (29) 29
rank metric codes (29) 29
error correction (27) 27
computer science, theory & methods (24) 24
algorithms (21) 21
upper bound (20) 20
coding (19) 19
subspace codes (18) 18
coding theory (17) 17
coding and information theory (15) 15
computer science - information theory (15) 15
error correction codes (15) 15
information and communication, circuits (15) 15
polynomials (15) 15
research (15) 15
cryptography (14) 14
data encryption (14) 14
discrete mathematics in computer science (14) 14
encoding (14) 14
reed-solomon codes (14) 14
bounds (13) 13
construction (13) 13
networks (13) 13
analysis (12) 12
combinatorics (12) 12
list decoding (12) 12
data structures, cryptology and information theory (11) 11
mathematical analysis (11) 11
rank-metric code (11) 11
block codes (10) 10
complexity theory (10) 10
kryptographie (10) 10
rank metric code (10) 10
subspaces (10) 10
vectors (10) 10
94b05 (9) 9
linear codes (9) 9
linearized polynomials (9) 9
usage (9) 9
constant dimension codes (8) 8
constant-dimension codes (8) 8
distance (8) 8
equivalence (8) 8
error analysis (8) 8
mathematics - combinatorics (8) 8
11t71 (7) 7
convolutional codes (7) 7
decoders (7) 7
security (7) 7
upper bounds (7) 7
öffentlicher schlüssel (7) 7
arrays (6) 6
code-based cryptography (6) 6
errors (6) 6
gabidulin code (6) 6
generators (6) 6
matrices (6) 6
mrd code (6) 6
random linear network coding (6) 6
semifield (6) 6
signatur (6) 6
skew polynomials (6) 6
telecommunications (6) 6
covering radius (5) 5
cryptography and security (5) 5
error (5) 5
error control codes (5) 5
ferrers diagram (5) 5
field (5) 5
hamming distance (5) 5
indexes (5) 5
maximum rank distance codes (5) 5
parity check codes (5) 5
public key cryptography (5) 5
receivers (5) 5
smart grid (5) 5
sum-rank metric (5) 5
94b60 (4) 4
asymptotic properties (4) 4
complexity (4) 4
conferences (4) 4
constant-weight codes (4) 4
data structures and information theory (4) 4
error correction & detection (4) 4
fields (4) 4
finite field (4) 4
finite fields (4) 4
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


IEEE Transactions on Information Theory, ISSN 0018-9448, 09/2019, Volume 65, Issue 9, pp. 5433 - 5453
Motivated by systems, where the information is represented by a graph such as neural networks, associative memories, and distributed systems. In this paper, we... 
EVENODD codes | rank metric codes | codes over graphs | Array codes | product codes | REGENERATING CODES | SCHEME | DISTRIBUTED STORAGE | COMPUTER SCIENCE, INFORMATION SYSTEMS | MDS ARRAY CODES | CONSTRUCTIONS | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 01/2017, Volume 63, Issue 1, pp. 164 - 168
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 08/2019, Volume 575, pp. 66 - 86
For any admissible value of the parameters and there exist -Maximum Rank Distance -linear codes. Indeed, it can be shown that if field extensions large enough... 
Gabidulin codes | Distinguisher | Rank metric | POLYNOMIALS | MATHEMATICS | MATHEMATICS, APPLIED | FIELD | PSEUDOREGULUS TYPE | SCATTERED LINEAR SETS | EQUIVALENCE | FAMILY | Parameter identification | Mathematics - Combinatorics
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 02/2013, Volume 59, Issue 2, pp. 1004 - 1017
Journal Article
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, ISSN 0916-8508, 09/2018, Volume E101A, Issue 9, pp. 1599 - 1602
We investigate linear complementary dual (LCD) rank-metric codes in this paper. We construct a class of LCD generalized Gabidulin codes by a self-dual basis of... 
LCD codes | MRD codes | Rank metric | Generalized Gabidulin codes | RANK DISTANCE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | generalized Gabidulin codes | COMPUTER SCIENCE, INFORMATION SYSTEMS | rank metric | ENGINEERING, ELECTRICAL & ELECTRONIC | Cartesian coordinates
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 03/2010, Volume 56, Issue 3, pp. 1378 - 1382
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 04/2016, Volume 62, Issue 4, pp. 1616 - 1630
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 11/2015, Volume 61, Issue 11, pp. 5765 - 5778
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 02/2019, Volume 65, Issue 2, pp. 1054 - 1062
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 09/2019, Volume 65, Issue 9, pp. 5454 - 5468
We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with... 
Measurement | subspace codes | Codes for distributed storage | Upper bound | locally recoverable codes | rank-metric codes | Distributed databases | Maintenance engineering | Servers | Arrays | Block codes | ERROR-CORRECTING CODES | ARRAY CODES | COMPUTER SCIENCE, INFORMATION SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
Journal of Algebra, ISSN 0021-8693, 06/2018, Volume 504, pp. 587 - 612
Reed–Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials,... 
Hamming metric | Skew polynomials | Sum-rank metric | Rank metric | Linearized polynomials | Reed–Solomon codes | Gabidulin codes
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 08/2016, Volume 62, Issue 8, pp. 4481 - 4493
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 02/2011, Volume 57, Issue 2, pp. 1124 - 1135
Journal Article
JOURNAL OF ALGEBRA, ISSN 0021-8693, 06/2018, Volume 504, pp. 587 - 612
Reed Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials,... 
Hamming metric | Reed-Solomon codes | Skew polynomials | Sum-rank metric | POLYNOMIALS | MATHEMATICS | NETWORK | Rank metric | Linearized polynomials | Gabidulin codes
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 10/2019, Volume 65, Issue 10, pp. 6204 - 6223
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for... 
Measurement | subspace codes | Rank-metric codes | Limiting | Shape | Conferences | Gabidulin codes | Task analysis | Ferrers diagrams | Information theory | RANK DISTANCE | COMPUTER SCIENCE, INFORMATION SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
Finite Fields and Their Applications, ISSN 1071-5797, 09/2018, Volume 53, pp. 1 - 20
In this paper we define and study a family of codes which are coming close to MRD codes. Thus we call them AMRD codes (almost MRD). An AMRD code is a code with... 
Rank defect | Rank metric codes | MRD codes and dually AMRD codes | MATHEMATICS | MATHEMATICS, APPLIED | NETWORK | LINEAR CODES
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 07/2019, Volume 65, Issue 7, pp. 4115 - 4130
Optimal rank-metric codes in Ferrers diagrams can be used to construct good subspace codes. Such codes consist of matrices having zeros at certain fixed... 
Q measurement | Upper bound | Systematics | Ferrers diagram | Network coding | rank-metric code | Encoding | subspace code | Manganese | Gabidulin code | ERROR-CORRECTING CODES | COMPUTER SCIENCE, INFORMATION SYSTEMS | CONSTANT DIMENSION CODES | ENGINEERING, ELECTRICAL & ELECTRONIC | Mathematics - Combinatorics
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.