Boris D. Kudryashov

Orcid: 0000-0002-5865-5283

According to our database1, Boris D. Kudryashov authored at least 85 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Nonbinary LDPC Coded QAM Signals With Optimized Mapping: Bounds and Simulation Results.
IEEE Trans. Inf. Theory, August, 2023

LDPC coded QAM signaling: Mapping and Shaping.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Shaping for NB QC-LDPC Coded QAM Signals.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Bound on the ML Decoding Error Probability for Coded QAM Signals with Shaping.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Design and Analysis of NB QC-LDPC Codes Over Small Alphabets.
IEEE Trans. Commun., 2022

Irregular Generalized LDPC codes in Practical Communication Scenarios.
Proceedings of the IEEE Information Theory Workshop, 2022

Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
A Weighted Bit Flipping Decoder for QC-MDPC-based Cryptosystems.
IACR Cryptol. ePrint Arch., 2021

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

A Random Coding Bound on the ML Decoding Error Probability for NB LDPC Coded QAM Signals.
Proceedings of the IEEE Information Theory Workshop, 2021

Euclidean Distance Spectra of Irregular NB LDPC Coded QAM Signals with Optimized Mappings.
Proceedings of the IEEE International Symposium on Information Theory, 2021

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

Optimization of Irregular NB QC-LDPC Block Codes over Small Alphabets.
Proceedings of the IEEE Information Theory Workshop, 2020

2019
Characterizing Packet Losses in Vehicular Networks.
IEEE Trans. Veh. Technol., 2019

Stopping Redundancy Hierarchy Beyond the Minimum Distance.
IEEE Trans. Inf. Theory, 2019

BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels.
IEEE Trans. Inf. Theory, 2019

LDPC Codes Over the BEC: Bounds and Decoding Algorithms.
IEEE Trans. Commun., 2019

Low Delay Inter-Packet Coding in Vehicular Networks.
Future Internet, 2019

Source coding with side information for binary memoryless sources.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Modeling Packet Losses in Communication Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Improved Redundant Parity-Check Based BP Decoding of LDPC Codes.
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.
CoRR, 2017

Average spectra for ensembles of LDPC codes and applications.
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.
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.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Searching for Binary and Nonbinary Block and Convolutional LDPC Codes.
IEEE Trans. Inf. Theory, 2016

Multi-Class Source-Channel Coding.
IEEE Trans. Inf. Theory, 2016

Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC.
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.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2014
Universal coding for memoryless sources with countably infinite alphabets.
Probl. Inf. Transm., 2014

High Order Modulation in Faster-Than-Nyquist Signaling Communication Systems.
Proceedings of the IEEE 80th Vehicular Technology Conference, 2014

A unified approach to optimization of LDPC codes for various communication scenarios.
Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Low-complexity fixed-to-fixed joint source-channel coding.
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.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Source-channel coding with multiple classes.
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.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Combinatorial optimization for improving QC LDPC codes performance.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth.
IEEE Trans. Inf. Theory, 2012

A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes.
IEEE Trans. Inf. Theory, 2012

Dual convolutional codes and the MacWilliams identities.
Probl. Inf. Transm., 2012

High-rate QC LDPC codes of short and moderate length with good girth profile.
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.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Woven convolutional graph codes with large free distances.
Probl. Inf. Transm., 2011

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

On the exact bit error probability for Viterbi decoding of convolutional codes.
Proceedings of the Information Theory and Applications Workshop, 2011

Some voltage graph-based LDPC tailbiting codes with large girth.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Double-Hamming based QC LDPC codes with large minimum distance.
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.
IEEE Trans. Inf. Theory, 2010

Woven graph codes: asymptotic performances and examples.
IEEE Trans. Inf. Theory, 2010

On weight enumerators and MacWilliams identity for convolutional codes.
Proceedings of the Information Theory and Applications Workshop, 2010

Near-optimum low-complexity lattice quantization.
Proceedings of the IEEE International Symposium on Information Theory, 2010

New low-density parity-check codes with large girth based on hypergraphs.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Graph-based convolutional and block LDPC codes.
Probl. Inf. Transm., 2009

Searching for high-rate convolutional codes via binary syndrome trellises.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Short quasi-cyclic LDPC codes from convolutional codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Soft-Output BEAST Decoding With Application to Product Codes.
IEEE Trans. Inf. Theory, 2008

An Improved Bound on the List Error Probability and List Distance Properties.
IEEE Trans. Inf. Theory, 2008

Scalar Quantization for Audio Data Coding
CoRR, 2008

Linear code-based vector quantization for independent random variables
CoRR, 2008

Asymptotic performances of woven graph codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Trellis Complexity of Short Linear Codes.
IEEE Trans. Inf. Theory, 2007

Random coding bound for the second moment of multidimensional lattices.
Probl. Inf. Transm., 2007

Random Quantization Bounds for Lattices over q -ary Linear Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Comparison of Some Trellis- and Tree-Based SISO Algorithms for Decoding and Equalization.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
On Suboptimum Component Decoding for Product Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
BEAST decoding of block codes obtained via convolutional codes.
IEEE Trans. Inf. Theory, 2005

BEAST decoding - asymptotic complexity.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Estimating the list size for BEAST-APP decoding.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Low State Complexity Block Codes Via Convolutional Codes.
IEEE Trans. Inf. Theory, 2004

A BEAST for Prowling in Trees.
IEEE Trans. Inf. Theory, 2004

BEAST decoding for block codes.
Eur. Trans. Telecommun., 2004

On APP-decoding using BEAST.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002
Tailbiting codes: Bounds and search results.
IEEE Trans. Inf. Theory, 2002

Tailbiting codes obtained via convolutional codes with large active distance-slopes.
IEEE Trans. Inf. Theory, 2002

1997
Rational rate punctured convolutional codes for soft-decision Viterbi decoding.
IEEE Trans. Inf. Theory, 1997

1995
Distance spectra and upper bounds on error probability for trellis codes.
IEEE Trans. Inf. Theory, 1995

Fast Exponentation in Cryptography.
Proceedings of the Applied Algebra, 1995

1993
Error probability for repeat request systems with convolutional codes.
IEEE Trans. Inf. Theory, 1993

On the covering radius of convolutional codes.
Proceedings of the Algebraic Coding, 1993

On Trellis Codes for Linear Predictive Speech Compression.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

Fast Infinite Response Filtering for Speech Processing.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1991
Soft Decoding for Block Codes Obtained from Convolutional Codes.
Proceedings of the Algebraic Coding, 1991


  Loading...