The following pages link to Han Mao Kiah (Q396761):
Displayed 47 items.
- Generalized balanced tournament designs with block size four (Q396762) (← links)
- A note on cyclic codes over \(\mathrm{GR}(p^{2},m)\) of length \(p^{k}\) (Q664399) (← links)
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\) (Q938779) (← links)
- PURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATION (Q2844419) (← links)
- Product Construction of Affine Codes (Q2944459) (← links)
- Codes for DNA Sequence Profiles (Q2976761) (← links)
- Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions (Q2983346) (← links)
- Estimates on the Size of Symbol Weight Codes (Q2989460) (← links)
- Coding for Racetrack Memories (Q4559583) (← links)
- Rates of DNA Sequence Profiles for Practical Values of Read Lengths (Q4566552) (← links)
- (Q4570855) (← links)
- Cooling Codes: Thermal-Management Coding for High-Performance Interconnects (Q4570873) (← links)
- Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families (Q4611006) (← links)
- Mutually Uncorrelated Primers for DNA-Based Data Storage (Q4682915) (← links)
- Repairing Reed-Solomon Codes With Multiple Erasures (Q4682937) (← links)
- Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes (Q4682940) (← links)
- Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes (Q4682971) (← links)
- Deciding the Confusability of Words under Tandem Repeats in Linear Time (Q4972689) (← links)
- Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality (Q5001729) (← links)
- Coding for Sequence Reconstruction for Single Edits (Q5030268) (← links)
- Repairing Reed-Solomon Codes via Subspace Polynomials (Q5032504) (← links)
- Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications (Q5032624) (← links)
- Explicit and Efficient WOM Codes of Finite Length (Q5123884) (← links)
- Low-Power Cooling Codes With Efficient Encoding and Decoding (Q5124465) (← links)
- Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications (Q5124473) (← links)
- Efficient and Explicit Balanced Primer Codes (Q5124507) (← links)
- Generalized Sphere-Packing Bound for Subblock-Constrained Codes (Q5151701) (← links)
- Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming (Q5151706) (← links)
- Robust Positioning Patterns with Low Redundancy (Q5221262) (← links)
- Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories (Q5224026) (← links)
- Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms (Q5236318) (← links)
- Switch Codes: Codes for Fully Parallel Reconstruction (Q5280884) (← links)
- Maximum Distance Separable Codes for Symbol-Pair Read Channels (Q5346251) (← links)
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality (Q5346479) (← links)
- Optimal Codes in the Enomoto-Katona Space (Q5364232) (← links)
- Asymmetric Lee Distance Codes for DNA-Based Storage (Q5369848) (← links)
- On the number of distinct \(k\)-decks: enumeration and bounds (Q6112289) (← links)
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions (Q6145733) (← links)
- Domination mappings into the Hamming ball: existence, constructions, and algorithms (Q6163784) (← links)
- Correcting Deletions With Multiple Reads (Q6195760) (← links)
- Codes for DNA Storage Channels (Q6256002) (← links)
- Locally Encodable and Decodable Codes for Distributed Storage Systems (Q6261025) (← links)
- Computing Permanents on a Trellis (Q6372901) (← links)
- Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution (Q6382445) (← links)
- Average Redundancy of Variable-Length Balancing Schemes \`{a} la Knuth (Q6397757) (← links)
- On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes (Q6427759) (← links)
- Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics (Q6435704) (← links)