LDPC code optimization based on Tanner graph mutations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23220%2F13%3A43919935" target="_blank" >RIV/49777513:23220/13:43919935 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
LDPC code optimization based on Tanner graph mutations
Original language description
The paper presents LDPC error correcting code optimization based on Tanner graph mutations. A statistical experiment focused on a heuristic LDPC code construction was performed with the genetic algorithm. The algorithm used is briefly described. Short wordlength LDPC code optimization was simulated. Results of these simulations are summarized in this paper.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
21st Telecommunications Forum (TELFOR) Proceedings of Papers
ISBN
978-1-4799-1419-7
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
389-392
Publisher name
IEEE
Place of publication
Bělehrad
Event location
Bělehrad, Srbsko
Event date
Nov 26, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—