research
∙
09/08/2023
A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs
A coded distributed computing (CDC) system aims to reduce the communicat...
share
research
∙
07/09/2023
Sharper Asymptotically Optimal CDC Schemes via Combinatorial Designs
Coded distributed computing (CDC) was introduced to greatly reduce the c...
research
∙
05/05/2023
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes
We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon...
research
∙
09/07/2022
Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols
Motivated by applications in distributed storage, distributed computing,...
research
∙
07/12/2022
How Much Entanglement Does a Quantum Code Need?
In the setting of entanglement-assisted quantum error-correcting codes (...
research
∙
06/20/2022
Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions
This paper proposes new propagation rules on quantum codes in the entang...
research
∙
09/28/2021
New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets
The correlation properties of sequences form a focal point in the design...
research
∙
09/28/2021
Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes
Locally repairable codes have become a key instrument in large-scale dis...
research
∙
12/18/2020
A Comparison of Distance Bounds for Quasi-Twisted Codes
Spectral bounds on the minimum distance of quasi-twisted codes over fini...
research
∙
07/30/2020
Quasi-Cyclic Codes
Quasi-cyclic codes form an important class of algebraic codes that inclu...
research
∙
07/19/2020
An explicit expression for Euclidean self-dual cyclic codes of length 2^k over Galois ring GR(4,m)
For any positive integers m and k, existing literature only determines t...
research
∙
02/09/2020
Holographic Image Sensing
Holographic representations of data enable distributed storage with prog...
research
∙
12/31/2019
Robust Positioning Patterns with Low Redundancy
A robust positioning pattern is a large array that allows a mobile devic...
research
∙
09/10/2019
Provably Secure Group Signature Schemes from Code-Based Assumptions
We solve an open question in code-based cryptography by introducing two ...
research
∙
06/26/2019
Non-malleable Coding for Arbitrary Varying Channels
Non-malleable codes were proposed in tamper resilient cryptology with th...
research
∙
06/12/2019
Spectral Bounds for Quasi-Twisted Codes
New lower bounds on the minimum distance of quasi-twisted codes over fin...
research
∙
06/12/2019
Good Stabilizer Codes from Quasi-Cyclic Codes over F_4 and F_9
We apply quantum Construction X on quasi-cyclic codes with large Hermiti...
research
∙
01/02/2019
Accountable Tracing Signatures from Lattices
Group signatures allow users of a group to sign messages anonymously in ...
research
∙
07/28/2018
Holographic Sensing
Holographic representations of data encode information in packets of equ...
research
∙
01/26/2018
Lattice-Based Group Signatures: Achieving Full Dynamicity (and Deniability) with Ease
In this work, we provide the first lattice-based group signature that of...
research
∙
01/25/2018
Forward-Secure Group Signatures from Lattices
Group signature is a fundamental cryptographic primitive, aiming to prot...
research
∙
01/24/2018