4 papers
The automorphism groups of random linear codes
Xiaoru Li, Qi Wang, Yue Zhou
The matching codewords framework is a key tool in recent algorithms for solving the Linear Code Equivalence (LCE) problem and in security analyses of LCE-based cryptographic scheme…
Demystifying the DAO Governance Process
Junjie Ma, Muhui Jiang, Jinan Jiang +5
Decentralized Autonomous Organization (DAO) becomes a popular governance solution for decentralized applications (dApps) to achieve decentralized governance. In the DAO, no single…
On the maximum size of variable-length non-overlapping codes
Geyang Wang, Qi Wang
Non-overlapping codes are a set of codewords such that the prefix of each codeword is not a suffix of any codeword in the set, including itself. If the lengths of the codewords are…
Two families of linear codes with desirable properties from some functions over finite fields
Ziling Heng, Xiaoru Li, Yansheng Wu +1
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes w…