On List-Decodability of Random Rank Metric Codes and Subspace Codes

Codes in rank metric have a wide range of applications. To construct such codes with better list-decoding performance explicitly, it is of interest to investigate the listdecodability of random rank metric codes. It is shown that if n/m = b is a constant, then for every rank metric code in Fm×n q wi...

Full description

Saved in:
Bibliographic Details
Main Author: Ding, Yang
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2016
Subjects:
Online Access:https://hdl.handle.net/10356/82171
http://hdl.handle.net/10220/41145
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first