Standard
Subspace codes. /
Khaleghi, Azedeh; Silva, Danilo; Kschischang, Frank R.
Cryptography and Coding : 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings. ed. / Matthew G. Parker. Cham: Springer, 2009. p. 1-21 (Lecture Notes in Computer Science; Vol. 5921).
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Harvard
Khaleghi, A, Silva, D & Kschischang, FR 2009,
Subspace codes. in MG Parker (ed.),
Cryptography and Coding : 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings. Lecture Notes in Computer Science, vol. 5921, Springer, Cham, pp. 1-21.
https://doi.org/10.1007/978-3-642-10868-6_1
APA
Khaleghi, A., Silva, D., & Kschischang, F. R. (2009).
Subspace codes. In M. G. Parker (Ed.),
Cryptography and Coding : 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings (pp. 1-21). (Lecture Notes in Computer Science; Vol. 5921). Springer.
https://doi.org/10.1007/978-3-642-10868-6_1
Vancouver
Khaleghi A, Silva D, Kschischang FR.
Subspace codes. In Parker MG, editor, Cryptography and Coding : 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings. Cham: Springer. 2009. p. 1-21. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-10868-6_1
Author
Khaleghi, Azedeh ; Silva, Danilo ; Kschischang, Frank R. /
Subspace codes. Cryptography and Coding : 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings. editor / Matthew G. Parker. Cham : Springer, 2009. pp. 1-21 (Lecture Notes in Computer Science).
Bibtex
@inproceedings{dd96a07d7f6d40eda505c812735e43ae,
title = "Subspace codes",
abstract = "This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding are also briefly described.",
author = "Azedeh Khaleghi and Danilo Silva and Kschischang, {Frank R.}",
year = "2009",
doi = "10.1007/978-3-642-10868-6_1",
language = "English",
isbn = "9783642108679",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "1--21",
editor = "Parker, {Matthew G.}",
booktitle = "Cryptography and Coding",
}
RIS
TY - GEN
T1 - Subspace codes
AU - Khaleghi, Azedeh
AU - Silva, Danilo
AU - Kschischang, Frank R.
PY - 2009
Y1 - 2009
N2 - This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding are also briefly described.
AB - This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding are also briefly described.
U2 - 10.1007/978-3-642-10868-6_1
DO - 10.1007/978-3-642-10868-6_1
M3 - Conference contribution/Paper
SN - 9783642108679
T3 - Lecture Notes in Computer Science
SP - 1
EP - 21
BT - Cryptography and Coding
A2 - Parker, Matthew G.
PB - Springer
CY - Cham
ER -
