You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Durham » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Durham

Return to search Previous output Next output

Output 36 of 59 in the submission

Article title

Packing and Covering Properties of Rank Metric Codes

Type

D - Journal article

DOI

10.1109/TIT.2008.928284

Title of journal

IEEE Transactions on Information Theory

Article number

Volume number

Issue number

First page of article

3873

ISSN of journal

0018-9448

Year of publication

2008

URL

http://dx.doi.org/10.1109/TIT.2008.928284

Number of additional authors

Additional information

<13>This work has been expanded in [MG and Zhiyuan Yan, "Bounds on Covering Codes with the Rank Metric," IEEE Communications Letters, vol. 13, no. 9, September 2009, pp. 691-693], where some lower bounds on covering codes are refined and two additional constructions of covering codes in the rank metric are given.

Interdisciplinary

Cross-referral requested

Research group

A - Algorithms and Complexity Research Group

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract