Publication result detail

Comparison of the convolutional codes design complexity

KŘIVÁNEK, V.

Original Title

Comparison of the convolutional codes design complexity

English Title

Comparison of the convolutional codes design complexity

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

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.

English abstract

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.

Keywords

Comparison Codes, FEC, Mathematical Characterization.

Key words in English

Comparison Codes, FEC, Mathematical Characterization.

Authors

KŘIVÁNEK, V.

RIV year

2010

Released

30.07.2008

ISBN

1738-6438

Periodical

International Transaction on Computer Science and Engineering

Volume

47

Number

1

State

Republic of Korea

Pages from

43

Pages to

48

Pages count

6

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"
}