Vitaly Skachek

IEEE Trans. Inf. Theory, August, 2023

On some batch code properties of the simplex code.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., May, 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

Batch Codes for Asynchronous Recovery of Data.

[BibT_eX]

[DOI]

Ago-Erik Riet

IEEE Trans. Inf. Theory, 2022

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

[BibT_eX]

[DOI]

Tähvend Uustalu

IEEE Trans. Commun., 2022

Preface of special issue on coding theory and applications.

[BibT_eX]

[DOI]

Ángela I. Barbero

Øyvind Ytrehus

Cryptogr. Commun., 2022

Partial Extraction from Invertible Bloom Filters.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 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

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

Failure Probability Analysis for Partial Extraction from Invertible Bloom Filters.

[BibT_eX]

[DOI]

CoRR, 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

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

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.

[BibT_eX]

[DOI]

CoRR, 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

2018

Asynchronous Batch and PIR Codes from Hypergraphs.

[BibT_eX]

[DOI]

Ago-Erik Riet

Proceedings of the IEEE Information Theory Workshop, 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

Special issue on network coding.

[BibT_eX]

[DOI]

Francisco A. Monteiro

Alister G. Burr

Ioannis Chatzigeorgiou

EURASIP J. Adv. Signal Process., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets.

[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

Constructions and Bounds for Batch Codes with Small Parameters.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 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

Two-party function computation on the reconciled data.

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2016

Spatially coupled LDPC coding in cooperative wireless networks.

[BibT_eX]

[DOI]

Dushantha N. K. Jayakody

Bin Chen

EURASIP J. Adv. Signal Process., 2016

Batch and PIR Codes and Their Connections to Locally-Repairable Codes.

[BibT_eX]

[DOI]

Dushantha Nalin K. Jayakody

CoRR, 2016

CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT.

[BibT_eX]

[DOI]

IEEE Access, 2016

Store-then-cooperate: Energy harvesting scheme in cooperative relay networks.

[BibT_eX]

[DOI]

Akashkumar Rajaram

Proceedings of the International Symposium on Wireless Communication Systems, 2016

Network function computation as a service in future 5G machine type communications.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 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

Bounds for batch codes with restricted query size.

[BibT_eX]

[DOI]

Hui Zhang

Proceedings of the IEEE International Symposium on Information Theory, 2016

Minimum pearson distance detection in the presence of unknown slowly varying offset.

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

Proceedings of the IEEE International Symposium on Information Theory, 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

2015

Refined upper bounds on stopping redundancy of binary linear codes.

[BibT_eX]

[DOI]

Yauhen Yakimenka

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

New bounds for permutation codes in Ulam metric.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Data dissemination problem in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Optimal Index Codes With Near-Extreme Rates.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Constant Weight Codes: An Approach Based on Knuth's Balancing Method.

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

IEEE J. Sel. Areas Commun., 2014

Subspace synchronization: A network-coding approach to object reconciliation.

[BibT_eX]

[DOI]

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

Linear Batch Codes.

[BibT_eX]

[DOI]

Helger Lipmaa

Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

Sparse binary matrices as efficient associative memories.

[BibT_eX]

[DOI]

Vincent Gripon

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Hybrid Noncoherent Network Coding.

[BibT_eX]

[DOI]

Olgica Milenkovic

Angelia Nedic

IEEE Trans. Inf. Theory, 2013

Error-Correction in Flash Memories via Codes in the Ulam Metric.

[BibT_eX]

[DOI]

Farzad Farnoud

Olgica Milenkovic

IEEE Trans. Inf. Theory, 2013

Error Correction for Index Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Sparse structured associative memories as efficient set-membership data structures.

[BibT_eX]

[DOI]

Vincent Gripon

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

On the Pseudocodeword Redundancy of Binary Linear Codes.

[BibT_eX]

[DOI]

Jens Zumbrägel

IEEE Trans. Inf. Theory, 2012

On the Security of Index Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Forwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree Graphs

[BibT_eX]

[DOI]

Vincent Gripon

CoRR, 2012

Compressing multisets using tries.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Random clique codes.

[BibT_eX]

[DOI]

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

Rank modulation for translocation error correction.

[BibT_eX]

[DOI]

Farzad Farnoud

Olgica Milenkovic

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

2011

Correcting a Fraction of Errors in Nonbinary Expander Codes With Linear Programming.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Index coding and error correction.

[BibT_eX]

[DOI]

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

On secure Index Coding with Side Information.

[BibT_eX]

[DOI]

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

2010

Recursive code construction for random networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

New bounds for codes over finite Frobenius rings.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Characterization of Graph-cover Pseudocodewords of Codes over $F_3$

[BibT_eX]

[DOI]

CoRR, 2010

Exploration of AWGNC and BSC Pseudocodeword Redundancy

[BibT_eX]

[DOI]

Jens Zumbrägel

CoRR, 2010

Characterization of graph-cover pseudocodewords of codes over F3.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On the pseudocodeword redundancy.

[BibT_eX]

[DOI]

Jens Zumbrägel

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Linear-programming decoding of nonbinary linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On LP decoding of nonbinary expander codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Probabilistic algorithm for finding roots of linearized polynomials.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary PSK Modulation over AWGN

[BibT_eX]

[DOI]

CoRR, 2008

Polytope representations for linear-programming decoding of non-binary linear codes.

[BibT_eX]

[DOI]

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

2007

Low-density parity-check codes: constructions and bounds.

[BibT_eX]

[DOI]

PhD thesis, 2007

Linear-programming Decoding of Non-binary Linear Codes

[BibT_eX]

[DOI]

CoRR, 2007

2006

Improved Nearly-MDS Expander Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Decoding of Expander Codes at Rates Close to Capacity.

[BibT_eX]

[DOI]

Alexei E. Ashikhmin

IEEE Trans. Inf. Theory, 2006

2004

On nearly-MDS expander codes.

[BibT_eX]

[DOI]

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

2003

Generalized minimum distance iterative decoding of expander codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

1998

Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.

[BibT_eX]

[DOI]

Tuvi Etzion