Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Rank_error-correcting_code> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- Rank_error-correcting_code abstract "In coding theory, rank codes are non-binary linear error-correcting codes over not Hamming but rank metric. They described a systematic way of building codes that could detect and correct multiple random rank errors. By adding redundancy with coding k-symbol word to a n-symbol word, a rank code can correct any errors of rank up to t = ⌊ (d − 1) / 2 ⌋, where d is a code distance. As an erasure code, it can correct up to d − 1 known erasures.A rank code is an algebraic linear code over the finite field similar to Reed–Solomon code.The rank of the vector over is the maximum number of linearly independent components over . The rank distance between two vectors over is the rank of the difference of these vectors.The rank code corrects all errors with rank of the error vector not greater than t.".
- Rank_error-correcting_code wikiPageExternalLink freeabs_all.jsp?arnumber=1228440.
- Rank_error-correcting_code wikiPageExternalLink freeabs_all.jsp?arnumber=1523717.
- Rank_error-correcting_code wikiPageExternalLink archive.phtml?wshow=paper&jrnid=ppi&paperid=967&option_lang=eng.
- Rank_error-correcting_code wikiPageID "35083145".
- Rank_error-correcting_code wikiPageRevisionID "604979813".
- Rank_error-correcting_code alphabetSize "Q = qN".
- Rank_error-correcting_code blockLength "n".
- Rank_error-correcting_code decoding Berlekamp–Massey_algorithm.
- Rank_error-correcting_code decoding Euclidean_algorithm.
- Rank_error-correcting_code decoding "with Frobenius poynomials".
- Rank_error-correcting_code distance "n − k + 1".
- Rank_error-correcting_code hasPhotoCollection Rank_error-correcting_code.
- Rank_error-correcting_code hierarchy Block_code.
- Rank_error-correcting_code hierarchy Rank_error-correcting_code.
- Rank_error-correcting_code messageLength "k".
- Rank_error-correcting_code name "Rank codes".
- Rank_error-correcting_code notation "[n, k, d]-code".
- Rank_error-correcting_code subject Category:Coding_theory.
- Rank_error-correcting_code subject Category:Error_detection_and_correction.
- Rank_error-correcting_code type Abstraction100002137.
- Rank_error-correcting_code type Code106667317.
- Rank_error-correcting_code type Communication100033020.
- Rank_error-correcting_code type WrittenCommunication106349220.
- Rank_error-correcting_code comment "In coding theory, rank codes are non-binary linear error-correcting codes over not Hamming but rank metric. They described a systematic way of building codes that could detect and correct multiple random rank errors. By adding redundancy with coding k-symbol word to a n-symbol word, a rank code can correct any errors of rank up to t = ⌊ (d − 1) / 2 ⌋, where d is a code distance.".
- Rank_error-correcting_code label "Rank error-correcting code".
- Rank_error-correcting_code label "Ранговый код".
- Rank_error-correcting_code sameAs m.0j64209.
- Rank_error-correcting_code sameAs Q4389869.
- Rank_error-correcting_code sameAs Q4389869.
- Rank_error-correcting_code sameAs Rank_error-correcting_code.
- Rank_error-correcting_code wasDerivedFrom Rank_error-correcting_code?oldid=604979813.
- Rank_error-correcting_code isPrimaryTopicOf Rank_error-correcting_code.