Jos H. Weber

IEEE Trans. Mol. Biol. Multi Scale Commun., 2024

Constructions and Properties of Efficient DNA Synthesis Codes.

[BibT_eX]

[DOI]

Kui Cai

Tuan Thanh Nguyen

IEEE Trans. Mol. Biol. Multi Scale Commun., 2024

Thermal-Aware Channel with Multiple Wires.

[BibT_eX]

[DOI]

Yeow Meng Chee

Tuvi Etzion

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Minimally Modified Balanced Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2023

Thermal-Aware Channel Capacity.

[BibT_eX]

[DOI]

Yeow Meng Chee

Tuvi Etzion

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

A New Detection Method for Noisy Channels With Time-Varying Offset.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

2021

Maximum Likelihood Decoding for Channels With Gaussian Noise and Signal Dependent Offset.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2021

On Single-Error-Detecting Codes for DNA-Based Data Storage.

[BibT_eX]

[DOI]

Joost A. M. de Groot

Charlot J. van Leeuwen

IEEE Commun. Lett., 2021

2020

Binary Block Codes for Noisy Channels With Unknown Offset.

[BibT_eX]

[DOI]

Kui Cai

IEEE Trans. Commun., 2020

Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Minimum Pearson Distance Detection Using a Difference Operator in the Presence of Unknown Varying Offset.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Maximum Likelihood Decoding for Multi-Level Cell Memories with Scaling and Offset Mismatch.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Communications, 2019

Decoding Criteria and Zero WER Analysis for Channels with Bounded Noise and Offset.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Communications, 2019

2018

Prefixless q-Ary Balanced Codes With Fast Syndrome-Based Error Correction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Dynamic Threshold Detection Based on Pearson Distance Detection.

[BibT_eX]

[DOI]

Kui Cai

IEEE Trans. Commun., 2018

Maximum Likelihood Decoding for Gaussian Noise Channels With Gain or Offset Mismatch.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

Binary Variable-to-Fixed Length Balancing Scheme With Simple Encoding/Decoding.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

Properties of Binary Pearson Codes.

[BibT_eX]

[DOI]

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

2017

Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Improved privacy of dynamic group services.

[BibT_eX]

[DOI]

EURASIP J. Inf. Secur., 2017

Bounds for cooperative locality using generalized hamming weights.

[BibT_eX]

[DOI]

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

2016

Pearson Codes.

[BibT_eX]

[DOI]

Simon R. Blackburn

IEEE Trans. Inf. Theory, 2016

Simple systematic Pearson coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

On the energy benefit of compute-and-forward for multiple unicasts.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Secure key-exchange protocol for implants using heartbeats.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Computing Frontiers, CF'16, 2016

2015

Random Access With Physical-Layer Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Hybrid Minimum Pearson and Euclidean Distance Detection.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2015

Secure transmission using an untrusted relay with scaled compute-and-forward.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Detection in the presence of additive noise and unknown offset.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2014

Concatenated permutation block codes for correcting single transposition errors.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Optimized markers for balancing runlength-limited sequences in optical recording.

[BibT_eX]

[DOI]

Carl H. Heymann

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

2013

Parity-Check Matrices Separating Erasures From Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Perspectives on Balanced Sequences

[BibT_eX]

[DOI]

Paul H. Siegel

CoRR, 2013

Concatenated permutation block codes based on set partitioning for substitution and deletion error-control.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Polarity-balanced codes.

[BibT_eX]

[DOI]

Paul H. Siegel

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Compute-and-Forward: Multiple bi-directional sessions on the line network.

[BibT_eX]

[DOI]

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

Physical-layer network coding on the random-access channel.

[BibT_eX]

[DOI]

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

Separating redundancy of linear MDS codes.

[BibT_eX]

[DOI]

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

2012

Error-Correcting Balanced Knuth Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff.

[BibT_eX]

[DOI]

Vladimir R. Sidorenko

Christian Senger

Probl. Inf. Transm., 2012

A DC-free multi-mode run-length limited coding scheme.

[BibT_eX]

[DOI]

Carl H. Heymann

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Compute-and-forward on wireless lattice networks with local interference.

[BibT_eX]

[DOI]

Proceedings of the 2012 International Symposium on Wireless Communication Systems (ISWCS), 2012

2011

Line and Lattice Networks Under Deterministic Interference Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Performance of Equal Gain Combining with Quantized Phases in Rayleigh Fading Channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2011

A note on non-binary multiple insertion/deletion correcting codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

A Knuth-based RDS-minimizing multi-mode code.

[BibT_eX]

[DOI]

Carl H. Heymann

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Balanced runlength limited codes using Knuth's algorithm.

[BibT_eX]

[DOI]

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

2010

Knuth's balanced codes revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Very Efficient Balanced Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2010

Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2010

An upper bound on the separating redundancy of linear block codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

BER analysis for MPAM signal constellations in the presence of fading and ADC quantization noise.

[BibT_eX]

[DOI]

Umar H. Rizvi

Gerard J. M. Janssen

IEEE Commun. Lett., 2009

Efficient balancing of q-ary sequences with parallel decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Simple balanced codes that approach capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On the energy benefit of network coding for wireless multiple unicast.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

On the Performance of UWB-IR With Interleaved Coding Modulation and Polarity Randomization on AWGN and Multipath Fading Channels.

[BibT_eX]

[DOI]

Michal M. Pietrzyk

IEEE Trans. Veh. Technol., 2008

Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

EXIT Chart Analysis of Iterative Demodulation and Decoding of MPSK Constellations with Signal Space Diversity.

[BibT_eX]

[DOI]

Nauman F. Kiyani

J. Commun., 2008

Energy Benefit of Network Coding for Multiple Unicast in Wireless Networks

[BibT_eX]

[DOI]

CoRR, 2008

Symbol Error Rate of Space-Time Coded Multi-Antenna Wireless Cooperative Networks.

[BibT_eX]

[DOI]

Javad Vazifehdan

Proceedings of the 67th IEEE Vehicular Technology Conference, 2008

Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the 68th IEEE Vehicular Technology Conference, 2008

BER analysis of single-carrier MPAM in the presence of ADC quantization noise.

[BibT_eX]

[DOI]

Umar H. Rizvi

Gerard J. M. Janssen

Proceedings of the IEEE 19th International Symposium on Personal, 2008

Knuth's balancing of codewords revisited.

[BibT_eX]

[DOI]

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

Multi-rate network coding for minimum-cost multicasting.

[BibT_eX]

[DOI]

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

Separating erasures from errors for decoding.

[BibT_eX]

[DOI]

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

Performance Analysis of a Partially Coherent System Using Constellation Rotation and Coordinate Interleaving.

[BibT_eX]

[DOI]

Nauman F. Kiyani

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007

Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Optimized Rotations for LDPC-Coded MPSK Constellations with Signal Space Diversity.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

Iterative Demodulation and Decoding for Rotated MPSK Constellations with Convolutional Coding and Signal Space Diversity.

[BibT_eX]

[DOI]

Nauman F. Kiyani

Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes.

[BibT_eX]

[DOI]

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

2005

Stopping set analysis for Hamming codes.

[BibT_eX]

[DOI]

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

2004

Limited-trial chase-like algorithms achieving bounded-distance decoding.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

IEEE Trans. Inf. Theory, 2004

Limited-trial chase-like bounded-distance decoding.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

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

2003

Reduced GMD decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Limited-trial Chase decoding.

[BibT_eX]

[DOI]

G. Arico

IEEE Trans. Inf. Theory, 2003

Dynamic Chase decoding algorithm.

[BibT_eX]

[DOI]

Carlos Barrios Vicente

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Low-complexity Chase-like bounded-distance decoding algorithms.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2003

2001

Reduced GMD decoding of concatenated codes.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2001

2000

Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Constructing efficient DC-free runlength-limited block codes for recording channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1998

Codes for Multiple Localized Burst Error Correction.

[BibT_eX]

[DOI]

Adrian Mardjuadi

IEEE Trans. Inf. Theory, 1998

1996

Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Optimized signal constellations for trellis-coded modulation on AWGN channels.

[BibT_eX]

[DOI]

René J. van der Vleuten

IEEE Trans. Commun., 1996

1995

Construction and evaluation of trellis-coded quantizers for memoryless sources.

[BibT_eX]

[DOI]

René J. van der Vleuten

IEEE Trans. Inf. Theory, 1995

Analysis of coding schemes for modulation and error control.

[BibT_eX]

[DOI]

Mario Blaum

IEEE Trans. Inf. Theory, 1995

Construction of Systematic Codes for Unidirectional Error Control.

[BibT_eX]

[DOI]

Anders G. Skolleborg

IEEE Trans. Computers, 1995

1994

Asymptotic results on codes for symmetric, unidirectional, and asymmetric error control.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

Cascading runlength-limited sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Adaptive channel error protection of subband encoded images.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1993

Efficient signal extension for subband/wavelet decomposition of arbitrary-length signals.

[BibT_eX]

[DOI]

Herjan J. Barnard

Jan Biemond

Proceedings of the Visual Communications and Image Processing '93, 1993

1992

Necessary and Sufficient Conditions on Block Codes Correcting/Detecting Errors of Various Types.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

A New Construction of Trellis-Coded Quantizers.

[BibT_eX]

[DOI]

René J. van der Vleuten

Proceedings of the Coding And Quantization, 1992

1991

Bounds and constructions for runlength-limited error-control block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1989

Bounds and constructions for codes correcting unidirectional errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1987

New upper bounds on the size of codes correcting asymmetric errors.

[BibT_eX]

[DOI]