Multidimensional parity check codes with short block lengths

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23220%2F16%3A43930201" target="_blank" >RIV/49777513:23220/16:43930201 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7818772/" target="_blank" >http://ieeexplore.ieee.org/document/7818772/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TELFOR.2016.7818772" target="_blank" >10.1109/TELFOR.2016.7818772</a>

Result language
angličtina
Original language name
Multidimensional parity check codes with short block lengths
Original language description
The Multidimensional Parity Check codes (MDPC) are one of the possible FEC methods of the short information messages. Especially the MDPCs with reduced generator matrix results in codes with block length from few to tens of bits with indispensable code-gain. This paper presents two methods of generation of the MDPC and describe the algorithm for iterative decoding of these codes. The MDPC with short block length were tested and their BER were compared with BER of equivalent LDPC.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2016 24th Telecommunications Forum (TELFOR 2016) : Proceedings of Papers
ISBN
978-1-5090-4086-5
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
258-261
Publisher name
IEEE
Place of publication
Piscataway
Event location
Belgrade, Serbia
Event date
Nov 22, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)