Reed-Solomon Coding: Variated Redundancy and Matrix Formalism › SPbU Researchers Portal

Reed-Solomon Coding: Variated Redundancy and Matrix Formalism

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Department of Medical and Biological Systems Control

DOI

https://doi.org/10.1109/CSITechnol.2017.8312154
Final published version

A.Y. Uteshev
A.V. Marov

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.

Original language	English
Title of host publication	11th International Conference on Computer Science and Information Technologies, CSIT 2017
Subtitle of host publication	Reed-Solomon Coding: Variated Redundancy and Matrix Formalism
Editors	Samvel Shoukourian
Place of Publication	Yerevan
Publisher	IEEE Industrial Electronics Society
Pages	121-124
Number of pages	4
ISBN (Electronic)	9781538628300
DOIs	https://doi.org/10.1109/CSITechnol.2017.8312154
State	Published - 9 Mar 2018
Event	11th International Conference on Computer Science and Information Technologies, CSIT 2017 - Yerevan, Armenia Duration: 20 Sep 2017 → 25 Sep 2017

Publication series

Name	11th International Conference on Computer Science and Information Technologies, CSIT 2017
Volume	2018-March

Conference

Conference	11th International Conference on Computer Science and Information Technologies, CSIT 2017
Country/Territory	Armenia
City	Yerevan
Period	20/09/17 → 25/09/17

Scopus subject areas

Computer Science(all)
Computer Science (miscellaneous)
Artificial Intelligence
Control and Optimization
Information Systems
Hardware and Architecture
Computational Theory and Mathematics

Research areas

Berlekamp-Welch algorithm, Reed-Solomon codes

ID: 16438809