| Publication | Date of Publication | Type |
|---|
Distributed quantized detection of sparse signals under Byzantine attacks
IEEE Transactions on Signal Processing | 2024-09-16 | Paper |
On ordered transmission based distributed Gaussian shift-in-mean detection under Byzantine attacks
IEEE Transactions on Signal Processing | 2024-09-12 | Paper |
Generalization of minimum storage regenerating codes for heterogeneous distributed storage systems
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
A Generalization of Array Codes With Local Properties and Efficient Encoding/Decoding
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Update Bandwidth for Distributed Storage
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols
IEEE Transactions on Computers | 2020-10-02 | Paper |
A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
On the Maximum Size of Block Codes Subject to a Distance Criterion
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Distributed Bayesian Detection in the Presence of Byzantine Data
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Distributed Detection in Tree Topologies With Byzantines
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Distributed Inference With M-Ary Quantized Data in the Presence of Byzantine Attacks
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks
IEEE Transactions on Computers | 2017-11-10 | Paper |
Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Target Localization in Wireless Sensor Networks Using Error Correcting Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Adaptive key pre-distribution model for distributed sensor networks
IET Communications | 2013-10-18 | Paper |
Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Asymptotic minimum covering radius of block codes
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
Distance-spectrum formulas on the largest minimum distance of block codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
A New Decoding Algorithm for Complete Decoding of Linear Block Codes
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
