Irina E. Bocharova

Sander Mikelsaar

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Nonbinary LDPC Coded QAM Signals With Optimized Mapping: Bounds and Simulation Results.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2023

LDPC coded QAM signaling: Mapping and Shaping.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

Shaping for NB QC-LDPC Coded QAM Signals.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

Bound on the ML Decoding Error Probability for Coded QAM Signals with Shaping.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Design and Analysis of NB QC-LDPC Codes Over Small Alphabets.

[BibT_eX]

[DOI]

Tähvend Uustalu

IEEE Trans. Commun., 2022

Prevention and Resolution of Labor Disputes.

[BibT_eX]

[DOI]

Alexander Rymanov

Int. J. Serv. Sci. Manag. Eng. Technol., 2022

Irregular Generalized LDPC codes in Practical Communication Scenarios.

[BibT_eX]

[DOI]

Sander Mikelsaar

Proceedings of the IEEE Information Theory Workshop, 2022

Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

A Weighted Bit Flipping Decoder for QC-MDPC-based Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

NB QC-LDPC Coded QAM Signals with Optimized Mapping: Bounds and Simulation Results.

[BibT_eX]

[DOI]

CoRR, 2021

A Random Coding Bound on the ML Decoding Error Probability for NB LDPC Coded QAM Signals.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Euclidean Distance Spectra of Irregular NB LDPC Coded QAM Signals with Optimized Mappings.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Optimization of NB QC-LDPC Block Codes and Their Performance Analysis.

[BibT_eX]

[DOI]

Tähvend Uustalu

CoRR, 2020

Optimization of Irregular NB QC-LDPC Block Codes over Small Alphabets.

[BibT_eX]

[DOI]

Tähvend Uustalu

Proceedings of the IEEE Information Theory Workshop, 2020

2019

Characterizing Packet Losses in Vehicular Networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2019

Stopping Redundancy Hierarchy Beyond the Minimum Distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

LDPC Codes Over the BEC: Bounds and Decoding Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Low Delay Inter-Packet Coding in Vehicular Networks.

[BibT_eX]

[DOI]

Future Internet, 2019

Source coding with side information for binary memoryless sources.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Modeling Packet Losses in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem.

[BibT_eX]

[DOI]

Thomas Johansson

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Improved Redundant Parity-Check Based BP Decoding of LDPC Codes.

[BibT_eX]

[DOI]

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

2017

ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

Average spectra for ensembles of LDPC codes and applications.

[BibT_eX]

[DOI]

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

Performance of ML decoding for ensembles of binary and nonbinary regular LDPC codes of finite lengths.

[BibT_eX]

[DOI]

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

Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance.

[BibT_eX]

[DOI]

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

2016

Searching for Binary and Nonbinary Block and Convolutional LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Multi-Class Source-Channel Coding.

[BibT_eX]

[DOI]

Albert Guillen i Fabregas

Alfonso Martinez

Adrià Tauste Campo

Gonzalo Vazquez-Vilar

IEEE Trans. Inf. Theory, 2016

Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

Low complexity algorithm approaching the ML decoding of binary LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2014

Low-complexity lossless image coding.

[BibT_eX]

[DOI]

Autom. Control. Comput. Sci., 2014

High Order Modulation in Faster-Than-Nyquist Signaling Communication Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE 80th Vehicular Technology Conference, 2014

A unified approach to optimization of LDPC codes for various communication scenarios.

[BibT_eX]

[DOI]

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

Low-complexity fixed-to-fixed joint source-channel coding.

[BibT_eX]

[DOI]

Albert Guillén i Fàbregas

Alfonso Martinez

Adrià Tauste Campo

Gonzalo Vazquez-Vilar

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

LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios.

[BibT_eX]

[DOI]

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

Source-channel coding with multiple classes.

[BibT_eX]

[DOI]

Albert Guillen i Fabregas

Alfonso Martinez

Adrià Tauste Campo

Gonzalo Vazquez-Vilar

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

2013

Near maximum-likelihood decoding of Generalized LDPC and woven graph codes.

[BibT_eX]

[DOI]

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

Combinatorial optimization for improving QC LDPC codes performance.

[BibT_eX]

[DOI]

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

2012

Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Dual convolutional codes and the MacWilliams identities.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

High-rate QC LDPC codes of short and moderate length with good girth profile.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

A greedy search for improved QC LDPC codes with good girth profile and degree distribution.

[BibT_eX]

[DOI]

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

2011

Woven convolutional graph codes with large free distances.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

An Analytic Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes

[BibT_eX]

[DOI]

CoRR, 2011

On the exact bit error probability for Viterbi decoding of convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

Some voltage graph-based LDPC tailbiting codes with large girth.

[BibT_eX]

[DOI]

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

Double-Hamming based QC LDPC codes with large minimum distance.

[BibT_eX]

[DOI]

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

2010

A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Woven graph codes: asymptotic performances and examples.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On weight enumerators and MacWilliams identity for convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

New low-density parity-check codes with large girth based on hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Graph-based convolutional and block LDPC codes.

[BibT_eX]

[DOI]

Roman V. Satyukov

Probl. Inf. Transm., 2009

Searching for high-rate convolutional codes via binary syndrome trellises.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Short quasi-cyclic LDPC codes from convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Soft-Output BEAST Decoding With Application to Product Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

An Improved Bound on the List Error Probability and List Distance Properties.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Asymptotic performances of woven graph codes.

[BibT_eX]

[DOI]

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

2007

Trellis Complexity of Short Linear Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

A Comparison of Some Trellis- and Tree-Based SISO Algorithms for Decoding and Equalization.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

On Suboptimum Component Decoding for Product Codes.

[BibT_eX]

[DOI]

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

2005

BEAST decoding of block codes obtained via convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

BEAST decoding - asymptotic complexity.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Estimating the list size for BEAST-APP decoding.

[BibT_eX]

[DOI]

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

2004

Low State Complexity Block Codes Via Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

A BEAST for Prowling in Trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

BEAST decoding for block codes.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2004

On APP-decoding using BEAST.

[BibT_eX]

[DOI]

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

2002

Tailbiting codes: Bounds and search results.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Tailbiting codes obtained via convolutional codes with large active distance-slopes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

1997

Rational rate punctured convolutional codes for soft-decision Viterbi decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

1995

Fast Exponentation in Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1995

1993

On the covering radius of convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1993

On Trellis Codes for Linear Predictive Speech Compression.

[BibT_eX]

[DOI]

Victor D. Kolesnik

Victor Yu. Krachkovsky

Eugeny P. Ovsjannikov

Boris K. Troyanovsky

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

Fast Infinite Response Filtering for Speech Processing.

[BibT_eX]

[DOI]

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

1991

Decoding for Multiple-Access Channels.

[BibT_eX]

[DOI]