The State of Lexicodes and Ferrers Diagram Rank-Metric Codes
In coding theory we wish to find as many codewords as possible, while simultaneously maintaining high distance between codewords to ease the detection and correction of errors. For linear codes, this translates to finding high-dimensional subspaces of a given metric space, where the induced distance...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2019
|
| Subjects: | |
| Online Access: | https://uknowledge.uky.edu/math_etds/66 https://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1067&context=math_etds |