Victor V. Zyablov

E. A. Krouk

Probl. Inf. Transm., 2022

Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel.

[BibT_eX]

[DOI]

A. A. Kurmukova

Probl. Inf. Transm., 2022

Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes.

[BibT_eX]

[DOI]

Anastasia Kurmukova

CoRR, 2022

2021

Error Exponents of LDPC Codes under Low-Complexity Decoding.

[BibT_eX]

[DOI]

Kirill V. Andreev

Entropy, 2021

New Code-Based Cryptosystem Based on Binary Image of Generalized Reed-Solomon Code.

[BibT_eX]

[DOI]

Eugenii Krouk

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

2020

Upper and Lower Estimates of Frame Error Rate for Convolutional Codes.

[BibT_eX]

[DOI]

Anastasiia Smeshko

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Theoretical Estimates of Burst Error Probability for Convolutional Codes.

[BibT_eX]

[DOI]

Anastasiia Smeshko

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019

Error correcting coding schemes for a broadcast channels.

[BibT_eX]

[DOI]

Vladimir G. Potapov

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

The influence of active distances on the distribution of bursts.

[BibT_eX]

[DOI]

Anastasiia Smeshko

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

2018

On the Local Erasure Correction Capacity of Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017

Generalized error-locating codes with component codes over the same alphabet.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2017

A binary block concatenated code based on two convolutional codes.

[BibT_eX]

[DOI]

Dmitri K. Zigangirov

Electron. Notes Discret. Math., 2017

On the multiple threshold decoding of LDPC codes over GF(q).

[BibT_eX]

[DOI]

Adv. Math. Commun., 2017

On the code distance of a woven block code construction.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the Performance of Block Woven Codes Constructions with Row-Wise Permutations.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016

Generalized concatenated codes with soft decoding of inner and outer codes.

[BibT_eX]

[DOI]

Alexey Kreschuk

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015

Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2015

A new coding method for a multiple-access system with a large number of active users.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

High-rate codes for high-reliability data transmission.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

On the capacity of a multiple-access vector adder channel.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2014

On the Capacity of the Multiuser Vector Adder Channel.

[BibT_eX]

[DOI]

CoRR, 2014

Generalized concatenated MIMO system with GMD decoding.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

On the upper bound on undetected error probability for LDPC code.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

On the user capacity for a multiple-access system in a vector disjunctive channel with errors.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

Low-density parity-check codes based on steiner systems and permutation matrices.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

On the Capacity of a PPM UWB Multiple-Access System with a Single User Noncoherent Reception.

[BibT_eX]

[DOI]

Proceedings of the Wireless Access Flexibility - First International Workshop, 2013

On a multiple-access in a vector disjunctive channel.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Analysis of the relation between properties of LDPC codes and the tanner graph.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

Multiple access system for a vector disjunctive channel.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

2011

On (Partial) unit memory codes based on Gabidulin codes.

[BibT_eX]

[DOI]

Antonia Wachter

Probl. Inf. Transm., 2011

Codes for MIMO transmission based on orthogonal sequences.

[BibT_eX]

[DOI]

Alexander A. Davydov

Probl. Inf. Transm., 2011

Bounds on the minimum code distance for nonbinary codes based on bipartite graphs.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes

[BibT_eX]

[DOI]

CoRR, 2011

Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Asymptotic estimation of error fraction corrected by binary LDPC code.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the lower bound of the free distance of partial unit memory codes based on LDPC Codes.

[BibT_eX]

[DOI]

Konstantin Kondrashov

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Upper and lower bounds on the minimum distance of expander codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Woven graph codes: asymptotic performances and examples.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Multitrial decoding of concatenated codes using fixed thresholds.

[BibT_eX]

[DOI]

Christian Senger

Probl. Inf. Transm., 2010

Asymptotic estimation of the fraction of errors correctable by <i>q</i>-ary LDPC codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2010

Special sequences as subcodes of reed-solomon codes.

[BibT_eX]

[DOI]

Alexander A. Davydov

Rustam E. Kalimullin

Probl. Inf. Transm., 2010

Adaptive Single-Trial Error/Erasure Decoding for Binary Codes

[BibT_eX]

[DOI]

CoRR, 2010

Optimal Thresholds for GMD Decoding with (L+1)/L-extended Bounded Distance Decoders

[BibT_eX]

[DOI]

CoRR, 2010

Single-trial decoding of concatenated codes using fixed or adaptive erasing.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

Adaptive single-trial error/erasure decoding of binary codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2010

Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Erasure correction by low-density codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2009

Low-complexity error correction of Hamming-code-based LDPC codes.

[BibT_eX]

[DOI]

Maja Loncar

Probl. Inf. Transm., 2009

On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel

[BibT_eX]

[DOI]

Christian Senger

CoRR, 2009

2008

On the optimum choice of a threshold in a frequency hopping OFDMA system.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2008

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Asymptotic performances of woven graph codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Finding distance profiles of unequal error protection block codes.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2007

Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Unequal error protection for convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Error exponents for product convolutional codes.

[BibT_eX]

[DOI]

Carlos Medina

Probl. Inf. Transm., 2006

On the complexity of suboptimal decoding for list and decision feedback schemes.

[BibT_eX]

[DOI]

Jürgen Freudenberger

Discret. Appl. Math., 2006

2005

Unequal error protection explained by state-transition graphs.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Maximum slope convolutional codes.

[BibT_eX]

[DOI]

Ralph Jordan

IEEE Trans. Inf. Theory, 2004

Woven convolutional codes. II: decoding aspects.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Detecting and Correcting Capabilities of Convolutional Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2004

Finding a list of best paths in a trellis.

[BibT_eX]

[DOI]

Georg Schmidt

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On unequal error protection for information symbols via active distances.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Boosting the error performance of suboptimal tailbiting decoders.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2003

On error exponents for woven convolutional codes with outer warp and unequal error protection.

[BibT_eX]

[DOI]

Ralph Jordan

Eur. Trans. Telecommun., 2003

2002

Woven convolutional codes I: Encoder properties.

[BibT_eX]

[DOI]

Stefan Höst

IEEE Trans. Inf. Theory, 2002

Distance Approach to Window Decoding.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

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

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

A Distance Measure Tailored to Tailbiting Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

2001

On the error exponent for woven convolutional codes with inner warp.

[BibT_eX]

[DOI]

Sergo Shavgulidze

IEEE Trans. Inf. Theory, 2001

Woven codes with outer warp: variations, design, and distance properties.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2001

2000

On the equivalence of generalized concatenated codes and generalized error location codes.

[BibT_eX]

[DOI]

Johannes Maucher

IEEE Trans. Inf. Theory, 2000

1999

On the error exponent for woven convolutional codes with outer warp.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Active Distances for Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

An Introduction to Generalized Concatenated Codes.

[BibT_eX]

[DOI]

Sergo Shavgulidze

Eur. Trans. Telecommun., 1999

Array Codes Correcting Likely Burst Error Patterns.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 1999

Some Results on Generalized Concatenation of Block Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Array Codes Correcting a Two-Dimensional Cluster of Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

1997

Capacity of MC-FDMA in mobile communications.

[BibT_eX]

[DOI]

R. Nogueroles

Proceedings of the 8th IEEE International Symposium on Personal, 1997

1995

Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes.

[BibT_eX]

[DOI]

Sergo Shavgulidze

Jørn Justesen

Proceedings of the Cryptography and Coding, 1995

1994

Decoding of convolutional codes using a syndrome trellis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

On Periodic (Partial) Unit Memory Codes with Maximum Free Distance.

[BibT_eX]

[DOI]

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

Partial Unit Memory Codes on the Base of Subcodes of Hadamard Codes.

[BibT_eX]

[DOI]

Alexei E. Ashikhmin

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

Concatenated Codes with Convolutional Inner and Outer Codes.

[BibT_eX]

[DOI]

Uwe Dettmar

Ulrich K. Sorger

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1988

Concatenated codes with convolutional inner codes.

[BibT_eX]

[DOI]

Jørn Justesen

Christian Thommesen