2025
Toward Universal Decoding of Binary Linear Block Codes via Enhanced Polar Transformations.
CoRR, January, 2025
Probabilistic Byzantine Attack on Federated Learning.
IEEE Trans. Signal Process., 2025
2024
Coded Distributed Multiplication for Matrices of Different Sparsity Levels.
IEEE Trans. Commun., 2024
Novel Prony-Based Channel Prediction Methods for Time-Varying Massive MIMO Channels.
Proceedings of the 99th IEEE Vehicular Technology Conference, 2024
Probabilistic Density Evolution Analysis of IRSA.
Proceedings of the International Symposium on Information Theory and Its Applications, 2024
2023
Distributed Scheduling for Status Update With Heterogeneous Services Under the IRSA Protocol.
IEEE Trans. Veh. Technol., November, 2023
On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input.
Entropy, April, 2023
perMAC: Perturbation-based MAC for Dense Wireless Networks with Periodic Traffic.
Proceedings of the International Conference on Computing, Networking and Communications, 2023
2022
Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel.
IEEE Trans. Inf. Theory, 2022
The Story of 1/e: ALOHA-based and Reinforcement-Learning-based Random Access for Delay-Constrained Communications.
CoRR, 2022
Triangular-QAM-Structured Constellation Design for Power-Domain Uplink NOMA.
Proceedings of the IEEE Global Communications Conference, 2022
2021
Lagrange Multiplier Optimization of the Probabilistic Caching Policy in Noise-Limited Network.
IEEE Trans. Veh. Technol., 2021
Update Bandwidth for Distributed Storage.
IEEE Trans. Inf. Theory, 2021
Systematic Polar Coded Modulation for Informed Receivers.
IEEE Trans. Commun., 2021
2020
Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks.
IEEE Trans. Signal Process., 2020
Transformation of Binary Linear Block Codes to Polar Codes With Dynamic Frozen.
IEEE Open J. Commun. Soc., 2020
Tightness of the Asymptotic Generalized Poor-Verdú Error Bound for the Memoryless Symmetric Channel.
CoRR, 2020
The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate.
Proceedings of the IEEE International Symposium on Information Theory, 2020
Power-Domain Downlink NOMA Constellation Design with Heterogeneous Reliability Requirements.
Proceedings of the 14th International Conference on Signal Processing and Communication Systems, 2020
Generalized Likelihood-Ratio Enabled Machine Learning for UE Detection over Grant-free SCMA.
Proceedings of the IEEE Global Communications Conference, 2020
2019
Optimal Inter-Constellation Rotation Based on Minimum Distance Criterion for Uplink NOMA.
IEEE Trans. Veh. Technol., 2019
On the Maximum Size of Block Codes Subject to a Distance Criterion.
IEEE Trans. Inf. Theory, 2019
Type II, III, and IV Linear-Phase FIR Structures Based on Cardinal Filters.
IEEE Trans. Circuits Syst. II Express Briefs, 2019
A Minimum Distance Criterion Based Constellation Design for Uplink NOMA.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019
2018
Target Localization Using Sensor Location Knowledge in Wireless Sensor Networks.
IEEE Wirel. Commun. Lett., 2018
Weak Flip Codes and their Optimality on the Binary Erasure Channel.
IEEE Trans. Inf. Theory, 2018
A Low-Complexity Maximum-Likelihood Decoder for Tail-Biting Convolutional Codes.
IEEE Trans. Commun., 2018
Delay-Constrained Input-Queued Switch.
IEEE J. Sel. Areas Commun., 2018
An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes.
IEEE Commun. Lett., 2018
Delay-Constrained Input-Queued Switch.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018
Connections Between the Error Probability and the r-wise Hamming Distances.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018
On the Asymptotic Performance of Delay-Constrained Slotted ALOHA.
Proceedings of the 27th International Conference on Computer Communication and Networks, 2018
The r-wise hamming distance and its operational interpretation for block codes.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018
Applications of an exact formula for the largest minimum distance of block codes.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018
2017
Local Threshold Design for Target Localization Using Error Correcting Codes in Wireless Sensor Networks in the Presence of Byzantine Attacks.
IEEE Trans. Inf. Forensics Secur., 2017
A General Structure of Linear-Phase FIR Filters With Derivative Constraints.
IEEE Trans. Circuits Syst. I Regul. Pap., 2017
An Exact Spectrum Formula for the Maximum Size of Finite Length Block Codes.
CoRR, 2017
Distance spectrum formula for the largest minimum hamming distance of finite-length binary block codes.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017
2016
Simple median-based EP PP scheme for enhancement of reconstructed Bayer colour filter array images.
IET Image Process., 2016
Optimal Byzantine attack for distributed inference with M-ary quantized data.
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Nonlinear codes outperform the best linear codes on the binary erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes.
CoRR, 2014
2013
Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2013
On the Design of Variable-Length Error-Correcting Codes.
IEEE Trans. Commun., 2013
Robust Decoding for Convolutionally Coded Systems Impaired by Memoryless Impulsive Noise.
IEEE Trans. Commun., 2013
Low-Complexity Soft-Output Sphere Decoding with Modified Repeated Tree Search Strategy.
IEEE Commun. Lett., 2013
BCH Code Selection and Iterative Decoding for BCH and LDPC Concatenated Coding System.
IEEE Commun. Lett., 2013
Analysis and practice of uniquely decodable one-to-one code.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
General expressions of derivative-constrained linear-phase type-I FIR filters.
Proceedings of the IEEE International Conference on Acoustics, 2013
A two-phase maximum-likelihood sequence estimation for receivers with partial CSI.
Proceedings of the 9th International Conference on Information, 2013
2012
Optimal Power Allocation for (N, K)-Limited Access Channels.
IEEE Trans. Inf. Theory, 2012
A Generalized Poor-Verdú Error Bound for Multihypothesis Testing.
IEEE Trans. Inf. Theory, 2012
Weak flip codes and applications to optimal code design on the binary erasure channel.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012
2011
A Generalized Poor-Verdu Error Bound for Multihypothesis Testing and the Channel Reliability Function
CoRR, 2011
A joint design of code and training sequence for frequency-selective block fading channels with partial CSI.
Proceedings of the 2011 International Conference on Wireless Communications & Signal Processing, 2011
Ultra-small block-codes for binary discrete memoryless channels.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011
On the construction and MAP decoding of optimal variable-length error-correcting codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
On the optimal power allocation for additive color noise parallel channels with limited access constraint.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Combining channel estimation and sensor fault protection in wireless sensor networks.
Proceedings of the 8th International Conference on Information, 2011
2010
Early-Elimination Modification for Priority-First Search Decoding.
IEEE Trans. Commun., 2010
Reliability-Based Decoding for Convolutional Tail-Biting Codes.
Proceedings of the 71st IEEE Vehicular Technology Conference, 2010
Path deletions for finite stack-size sequential-type decoding algorithms.
Proceedings of the International Symposium on Information Theory and its Applications, 2010
2009
Maximum-likelihood priority-first search decodable codes for combined channel estimation and error correction.
IEEE Trans. Inf. Theory, 2009
On the coding scheme for joint channel estimation and error correction over block fading channels.
Proceedings of the IEEE 20th International Symposium on Personal, 2009
A systematic space-time code design and its maximum-likelihood decoding for combined channel estimation and error correction.
Proceedings of the IEEE International Symposium on Information Theory, 2009
2008
Low-complexity ML decoding for convolutional tail-biting codes.
IEEE Commun. Lett., 2008
2007
Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks.
IEEE Trans. Inf. Theory, 2007
Flip CRC Modification for Message Length Detection.
IEEE Trans. Commun., 2007
Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency.
IEEE Trans. Commun., 2007
Analysis of the Sufficient Path Elimination Window for the Maximum-Likelihood Sequential-Search Decoding Algorithm for Binary Convolutional Codes
CoRR, 2007
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality
CoRR, 2007
Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Protection
CoRR, 2007
Reduction of Computational Complexity and Sufficient Stack Size of the MLSDA by Early Elimination.
Proceedings of the IEEE International Symposium on Information Theory, 2007
2006
A systematic bit-wise decomposition of M-ary symbol metric.
IEEE Trans. Wirel. Commun., 2006
On the Design of Soft-Decision Fusion Rule for Coding Approach in Wireless Sensor Networks.
Proceedings of the Wireless Algorithms, 2006
Fault-Tolerance Analysis of a Wireless Sensor Network with Distributed Classification Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
2005
Distributed fault-tolerant classification in wireless sensor networks.
IEEE J. Sel. Areas Commun., 2005
Strategies for blind transport format detection using cyclic redundancy check in UMTS WCDMA.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005
A Bridge-Node Aided Multi-Hop Routing Scheme.
Proceedings of the 2005 International Conference on Wireless Networks, 2005
Asymptotic performance analysis for minimum Hamming distance fusion [wireless sensor network applications].
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005
2004
Csiszár's cutoff rates for the general hypothesis testing problem.
IEEE Trans. Inf. Theory, 2004
Optimum transmission range for wireless ad hoc networks.
Proceedings of the 2004 IEEE Wireless Communications and Networking Conference , 2004
2002
A note on the Poor-Verdú upper bound for the channel reliability function.
IEEE Trans. Inf. Theory, 2002
A maximum-likelihood soft-decision sequential decoding algorithm for binary convolutional codes.
IEEE Trans. Commun., 2002
2001
Csiszár's cutoff rates for arbitrary discrete sources.
IEEE Trans. Inf. Theory, 2001
Asymptotic Minimum Covering Radius of Block Codes.
SIAM J. Discret. Math., 2001
2000
Distance-spectrum formulas on the largest minimum distance of block codes.
IEEE Trans. Inf. Theory, 2000
Generalization of Gártner-Ellis Theorem.
IEEE Trans. Inf. Theory, 2000
1999
Optimistic Shannon coding theorems for arbitrary single-user systems.
IEEE Trans. Inf. Theory, 1999
1998
A Rate-Distortion Theorem for Arbitrary Discrete Sources.
IEEE Trans. Inf. Theory, 1998
1997
Broadband service creation and operations.
IEEE Commun. Mag., 1997
Architecture for Two-Way Data Services over Residential Area CATV Networks.
Proceedings of the Proceedings IEEE INFOCOM '97, 1997
1996
General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds.
IEEE Trans. Inf. Theory, 1996
1995
Error bounds for parallel distributed detection under the Neyman-Pearson criterion.
IEEE Trans. Inf. Theory, 1995
1994
Correction to 'New asymptotic results in parallel distributed detection' (Nov 93 1847-1863).
IEEE Trans. Inf. Theory, 1994
1993
New asymptotic results in parallel distributed detection.
IEEE Trans. Inf. Theory, 1993
1988
Stroke Relation Coding - a New Approach to the Recognition of Multi-Font Printed Chinese Characters.
Int. J. Pattern Recognit. Artif. Intell., 1988
1987
A Computing Architecture of Adjustable Convolution System for Image Processing.
J. Inf. Sci. Eng., 1987