Detail publikačního výsledku

Comparison of the convolutional codes design complexity

KŘIVÁNEK, V.

Originální název

Comparison of the convolutional codes design complexity

Anglický název

Comparison of the convolutional codes design complexity

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

Errors tending to burst appear ever more frequently. One of the causes of such a phenomenon is the continuous transmission rate increase. We can use convolutional codes capable of making such a transmission effectively and sufficiently secure. The basic convolutional codes (Hagelbarger code, Iwadari-Massey code, Berlekamp-Preparate code) are to be compared in this paper because they are more simple as regards their circuit solution and thus their function can be simulated more easily.

Anglický abstrakt

Errors tending to burst appear ever more frequently. One of the causes of such a phenomenon is the continuous transmission rate increase. We can use convolutional codes capable of making such a transmission effectively and sufficiently secure. The basic convolutional codes (Hagelbarger code, Iwadari-Massey code, Berlekamp-Preparate code) are to be compared in this paper because they are more simple as regards their circuit solution and thus their function can be simulated more easily.

Klíčová slova

Comparison Codes, FEC, Mathematical Characterization.

Klíčová slova v angličtině

Comparison Codes, FEC, Mathematical Characterization.

Autoři

KŘIVÁNEK, V.

Rok RIV

2010

Vydáno

30.07.2008

ISSN

1738-6438

Periodikum

International Transaction on Computer Science and Engineering

Svazek

47

Číslo

1

Stát

Korejská republika

Strany od

43

Strany do

48

Strany počet

6

Plný text v Digitální knihovně

BibTex

@article{BUT47142,
  author="Vítězslav {Křivánek}",
  title="Comparison of the convolutional codes design complexity",
  journal="International Transaction on Computer Science and Engineering",
  year="2008",
  volume="47",
  number="1",
  pages="43--48",
  issn="1738-6438"
}