Standard

Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. / Uteshev, A.Y.; Marov, A.V.

11th International Conference on Computer Science and Information Technologies, CSIT 2017: Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. ред. / Samvel Shoukourian. Yerevan : IEEE Industrial Electronics Society, 2018. стр. 121-124 (11th International Conference on Computer Science and Information Technologies, CSIT 2017; Том 2018-March).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › Рецензирование

Harvard

Uteshev, AY & Marov, AV 2018, Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. в S Shoukourian (ред.), 11th International Conference on Computer Science and Information Technologies, CSIT 2017: Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. 11th International Conference on Computer Science and Information Technologies, CSIT 2017, Том. 2018-March, IEEE Industrial Electronics Society, Yerevan, стр. 121-124, 11th International Conference on Computer Science and Information Technologies, CSIT 2017, Yerevan, Армения, 20/09/17. https://doi.org/10.1109/CSITechnol.2017.8312154

APA

Uteshev, A. Y., & Marov, A. V. (2018). Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. в S. Shoukourian (Ред.), 11th International Conference on Computer Science and Information Technologies, CSIT 2017: Reed-Solomon Coding: Variated Redundancy and Matrix Formalism (стр. 121-124). (11th International Conference on Computer Science and Information Technologies, CSIT 2017; Том 2018-March). IEEE Industrial Electronics Society. https://doi.org/10.1109/CSITechnol.2017.8312154

Vancouver

Uteshev AY, Marov AV. Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. в Shoukourian S, Редактор, 11th International Conference on Computer Science and Information Technologies, CSIT 2017: Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. Yerevan: IEEE Industrial Electronics Society. 2018. стр. 121-124. (11th International Conference on Computer Science and Information Technologies, CSIT 2017). https://doi.org/10.1109/CSITechnol.2017.8312154

Author

Uteshev, A.Y. ; Marov, A.V. / Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. 11th International Conference on Computer Science and Information Technologies, CSIT 2017: Reed-Solomon Coding: Variated Redundancy and Matrix Formalism. Редактор / Samvel Shoukourian. Yerevan : IEEE Industrial Electronics Society, 2018. стр. 121-124 (11th International Conference on Computer Science and Information Technologies, CSIT 2017).

BibTeX

@inproceedings{cb330add1aba4563a3709ee57a44cdac,
title = "Reed-Solomon Coding: Variated Redundancy and Matrix Formalism",
abstract = "We aim to construct a version of the Reed-Solomon coding procedure which admits an easy extension when the number of checksums has to be increased due to the rise of the expected error rate.",
keywords = "Berlekamp-Welch algorithm, Reed-Solomon codes",
author = "A.Y. Uteshev and A.V. Marov",
year = "2018",
month = mar,
day = "9",
doi = "10.1109/CSITechnol.2017.8312154",
language = "English",
series = "11th International Conference on Computer Science and Information Technologies, CSIT 2017",
publisher = "IEEE Industrial Electronics Society",
pages = "121--124",
editor = "{ Shoukourian}, Samvel",
booktitle = "11th International Conference on Computer Science and Information Technologies, CSIT 2017",
note = "11th International Conference on Computer Science and Information Technologies, CSIT 2017 ; Conference date: 20-09-2017 Through 25-09-2017",

}

RIS

TY - GEN

T1 - Reed-Solomon Coding: Variated Redundancy and Matrix Formalism

AU - Uteshev, A.Y.

AU - Marov, A.V.

PY - 2018/3/9

Y1 - 2018/3/9

N2 - We aim to construct a version of the Reed-Solomon coding procedure which admits an easy extension when the number of checksums has to be increased due to the rise of the expected error rate.

AB - We aim to construct a version of the Reed-Solomon coding procedure which admits an easy extension when the number of checksums has to be increased due to the rise of the expected error rate.

KW - Berlekamp-Welch algorithm

KW - Reed-Solomon codes

UR - http://www.scopus.com/inward/record.url?scp=85050616929&partnerID=8YFLogxK

U2 - 10.1109/CSITechnol.2017.8312154

DO - 10.1109/CSITechnol.2017.8312154

M3 - Conference contribution

T3 - 11th International Conference on Computer Science and Information Technologies, CSIT 2017

SP - 121

EP - 124

BT - 11th International Conference on Computer Science and Information Technologies, CSIT 2017

A2 - Shoukourian, Samvel

PB - IEEE Industrial Electronics Society

CY - Yerevan

T2 - 11th International Conference on Computer Science and Information Technologies, CSIT 2017

Y2 - 20 September 2017 through 25 September 2017

ER -

ID: 16438809