Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Problemy Peredachi Informatsii, 2002, Volume 38, Issue 1, Pages 48–58 (Mi ppi1299)  

This article is cited in 5 scientific papers (total in 5 papers)

Coding Theory

Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code

M. Handlery, R. Johannesson, V. V. Zyablov
Full-text PDF (610 kB) Citations (5)
References:
Abstract: Woven convolutional codes with one tailbiting component code are studied and their generator matrices are given. It is shown that, if the constituent encoders are identical, a woven convolutional encoder with an outer convolutional warp and one inner tailbiting encoder (WIT) generates the same code as a woven convolutional encoder with one outer tailbiting encoder and an inner convolutional warp (WOT). However, for rate $R_{tb}<1$ tailbiting encoders, the WOT cannot be an encoder realization with a minimum number of delay elements. Lower bounds on the free distance and active distances of woven convolutional codes with a tailbiting component code are given. These bounds are equal to those for woven codes consisting exclusively of unterminated convolutional codes. However, for woven convolutional codes with one tailbiting component code, the conditions for the bounds to hold are less strict.
Received: 22.05.2001
English version:
Problems of Information Transmission, 2002, Volume 38, Issue 1, Pages 41–49
DOI: https://doi.org/10.1023/A:1020042222802
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: M. Handlery, R. Johannesson, V. V. Zyablov, “Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code”, Probl. Peredachi Inf., 38:1 (2002), 48–58; Problems Inform. Transmission, 38:1 (2002), 41–49
Citation in format AMSBIB
\Bibitem{HanJohZya02}
\by M.~Handlery, R.~Johannesson, V.~V.~Zyablov
\paper Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code
\jour Probl. Peredachi Inf.
\yr 2002
\vol 38
\issue 1
\pages 48--58
\mathnet{http://mi.mathnet.ru/ppi1299}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2101311}
\zmath{https://zbmath.org/?q=an:1027.94026}
\transl
\jour Problems Inform. Transmission
\yr 2002
\vol 38
\issue 1
\pages 41--49
\crossref{https://doi.org/10.1023/A:1020042222802}
Linking options:
  • https://www.mathnet.ru/eng/ppi1299
  • https://www.mathnet.ru/eng/ppi/v38/i1/p48
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:539
    Full-text PDF :209
    References:56
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024