Han Mao Kiah

J. Comb. Theory, Ser. A, 2025

2024

Recovery Sets of Subspaces From a Simplex Code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, October, 2024

Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2024

Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à La Knuth.

[BibT_eX]

[DOI]

Duc Tu Dao

IEEE Trans. Inf. Theory, July, 2024

Evaluating the Gilbert-Varshamov Bound for Constrained Systems.

[BibT_eX]

[DOI]

Keshav Goyal

Entropy, April, 2024

Survey for a Decade of Coding for DNA Storage.

[BibT_eX]

[DOI]

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

Guest Editorial Plenty of Room at at Bottom: Ten Years of DNA-Based Data Storage.

[BibT_eX]

[DOI]

Paul H. Siegel

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

Querying Twice to Achieve Information-Theoretic Verifiability in Private Information Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2024

Verifiable Coded Computation of Multiple Functions.

[BibT_eX]

[DOI]

Wilton Kim

Stanislav Kruglik

IEEE Trans. Inf. Forensics Secur., 2024

Verifiable Information-Theoretic Function Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Repairing Reed-Solomon Codes with Side Information.

[BibT_eX]

[DOI]

CoRR, 2024

Permutation Recovery Problem against Deletion Errors for DNA Data Storage.

[BibT_eX]

[DOI]

CoRR, 2024

Gilbert-Varshamov Bound for Codes in L1 Metric using Multivariate Analytic Combinatorics.

[BibT_eX]

[DOI]

CoRR, 2024

Coding for Synthesis Defects.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2024

Repairing a Single Erasure in Reed-Solomon Codes with Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Private Repair of a Single Erasure in Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Decoding Sparse Reed-Solomon Codes with Known Support.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Repairing with Zero Skip Cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Two-Dimensional RC/SW Constrained Codes: Bounded Weight and Almost Balanced Weight.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2023

Towards Designing and Learning Piecewise Space-Filling Curves.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Efficient Algorithms for the Bee-Identification Problem.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Bee Identification Problem for DNA Strands.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

On the number of distinct k-decks: Enumeration and bounds.

[BibT_eX]

[DOI]

Sankeerth Rao Karingula

Adv. Math. Commun., 2023

Domination mappings into the hamming ball: Existence, constructions, and algorithms.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Coded Computation of Multiple Functions.

[BibT_eX]

[DOI]

Wilton Kim

Stanislav Kruglik

Proceedings of the IEEE Information Theory Workshop, 2023

Data-Driven Bee Identification for DNA Strands.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

k-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Deletion Correcting Codes for Efficient DNA Synthesis.

[BibT_eX]

[DOI]

Van Long Phuoc Pham

Proceedings of the IEEE International Symposium on Information Theory, 2023

Committed Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2023, 2023

2022

Correcting Deletions With Multiple Reads.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Coding for Sequence Reconstruction for Single Edits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Example-based Spatial Pattern Matching.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight.

[BibT_eX]

[DOI]

CoRR, 2022

Average Redundancy of Variable-Length Balancing Schemes à la Knuth.

[BibT_eX]

[DOI]

Duc Tu Dao

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

Using One Redundant Bit to Construct Two-Dimensional Almost-Balanced Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Generalized Sphere-Packing Bound for Subblock-Constrained Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Repairing Reed-Solomon Codes via Subspace Polynomials.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming.

[BibT_eX]

[DOI]

Hui Zhang

IEEE Trans. Inf. Theory, 2021

Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Computing Permanents on a Trellis.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Bee Identification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Correcting Two Deletions with More Reads.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Regular Multiset Combinatorial Batch Codes over Vector Spaces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coding for Segmented Edits with Local Weight Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Efficient and Explicit Balanced Primer Codes.

[BibT_eX]

[DOI]

Hengjia Wei

IEEE Trans. Inf. Theory, 2020

Explicit and Efficient WOM Codes of Finite Length.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Low-Power Cooling Codes With Efficient Encoding and Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Robust Positioning Patterns with Low Redundancy.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.

[BibT_eX]

[DOI]

CoRR, 2020

Optimal Reconstruction Codes for Deletion Channels.

[BibT_eX]

[DOI]

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

Constrained Coding with Error Control for DNA-Based Data Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Sequence Reconstruction for Single Edits.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Polar Codes with Balanced Codewords.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Locally Balanced Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Maximum Length of Robust Positioning Sequences.

[BibT_eX]

[DOI]

Duc Tu Dao

Hengjia Wei

Proceedings of the IEEE International Symposium on Information Theory, 2020

Recovery Sets for Subspaces from a Vector Space.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Efficient Constrained Encoders Correcting a Single Nucleotide Edit in DNA Storage.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019

Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Deciding the Confusability of Words under Tandem Repeats in Linear Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Optimal Codes Correcting a Single Indel / Edit for DNA-Based Data Storage.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Coding for Write ℓ-step-up Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage.

[BibT_eX]

[DOI]

S. M. Hossein Tabatabaei Yazdi

Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Number of Distinct k-Decks: Enumeration and Bounds.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

2018

Mutually Uncorrelated Primers for DNA-Based Data Storage.

[BibT_eX]

[DOI]

Ryan Gabrys

IEEE Trans. Inf. Theory, 2018

Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Repairing Reed-Solomon Codes With Multiple Erasures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Coding for Racetrack Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Cooling Codes: Thermal-Management Coding for High-Performance Interconnects.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Improved Asymptotic Sphere-Packing Bounds for Subblock-Constrained Codes.

[BibT_eX]

[DOI]

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

Reducing the Average Delay in Gradient Coding.

[BibT_eX]

[DOI]

Ming Hui Jovan Lee

Ivan Tjuawinata

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

Codes Correcting Limited-Shift Errors in Racetrack Memories.

[BibT_eX]

[DOI]

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

Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications.

[BibT_eX]

[DOI]

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

2017

Switch Codes: Codes for Fully Parallel Reconstruction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Asymmetric Lee Distance Codes for DNA-Based Storage.

[BibT_eX]

[DOI]

Ryan Gabrys

IEEE Trans. Inf. Theory, 2017

Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Rates of DNA Sequence Profiles for Practical Values of Read Lengths.

[BibT_eX]

[DOI]

Zuling Chang

Martianus Frederic Ezerman

IEEE Trans. Inf. Theory, 2017

Codes correcting position errors in racetrack memories.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Binary subblock energy-constrained codes: Bounds on code size and asymptotic rate.

[BibT_eX]

[DOI]

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

Bounds on the asymptotic rate of binary constant subblock-composition codes.

[BibT_eX]

[DOI]

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

Repairing reed-solomon codes with two erasures.

[BibT_eX]

[DOI]

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

Explicit constructions of finite-length WOM codes.

[BibT_eX]

[DOI]

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

Geometric orthogonal codes better than optical orthogonal codes.

[BibT_eX]

[DOI]

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

2016

Synchronization and Deduplication in Coded Distributed Storage Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Codes for DNA Sequence Profiles.

[BibT_eX]

[DOI]

Gregory J. Puleo

S. M. Hossein Tabatabaei Yazdi

IEEE Trans. Inf. Theory, 2016

Weakly mutually uncorrelated codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

String concatenation construction for Chebyshev permutation channel codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Rates of constant-composition codes that mitigate intercell interference.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

On the number of DNA sequence profiles for practical values of read lengths.

[BibT_eX]

[DOI]

Zuling Chang

Martianus Frederic Ezerman

S. M. Hossein Tabatabaei Yazdi

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

DNA-Based Storage: Trends and Methods.

[BibT_eX]

[DOI]

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

Product Construction of Affine Codes.

[BibT_eX]

[DOI]

Patrick Solé

SIAM J. Discret. Math., 2015

Optimal Codes in the Enomoto-Katona Space.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Codes for DNA storage channels.

[BibT_eX]

[DOI]

Gregory J. Puleo

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Local codes with addition based repair.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Asymmetric Lee distance codes: New bounds and constructions.

[BibT_eX]

[DOI]

Ryan Gabrys

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Optimal binary switch codes with small query size.

[BibT_eX]

[DOI]

Zhiying Wang

Yuval Cassuto

Proceedings of the IEEE International Symposium on Information Theory, 2015

Synchronizing edits in distributed storage networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Locally Encodable and Decodable Codes for Distributed Storage Systems.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014

Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Rewritable coset coding for flash memories.

[BibT_eX]

[DOI]

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

2013

Cross-Bifix-Free Codes Within a Constant Factor of Optimality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Estimates on the Size of Symbol Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Maximum Distance Separable Codes for Symbol-Pair Read Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Importance of Symbol Equity in Coded Modulation for Power Line Communications.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2013

Generalized Balanced Tournament Designs with Block Size Four.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Matrix codes and multitone frequency shift keying for power line communications.

[BibT_eX]

[DOI]

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

2012

A note on cyclic codes over GR(p 2, m) of length p k.

[BibT_eX]

[DOI]

Ka Hin Leung

San Ling

Des. Codes Cryptogr., 2012

Maximum distance separable symbol-pair codes.

[BibT_eX]

[DOI]

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

Optimal equitable symbol weight codes for power line communications.

[BibT_eX]

[DOI]

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

2008

Cyclic codes over GR(p2, m) of length pk.

[BibT_eX]

[DOI]