Designs, Codes and Cryptography
Издатель: Springer Nature · ISSN 0925-1022,1573-7586 · 429 статей
- New constructions of complete permutations in multiplication
- Improved differential and linear cryptanalysis on round-reduced SIMON
- $$\lambda $$-fold near-factorizations of groups
-
Cyclic completely regular codes $$C_{1,5}$$
Abstract We construct a family of cyclic completely regular codes (CRCs) of length $$n=2^m-1$$ n = 2 m - 1 and compute their intersection arrays. These codes, denoted $$C_{1,5}$$ C 1 , 5 , are generated by the product $$m_1(x)m_5(x)$$ m...
- Multipath PA-PUFs generate all Boolean functions
- On binary codes that are maximal totally isotropic subspaces with respect to an alternating form
- On block-transitive 3-designs with a chain of imprimitive partitions
- Cliques in Paley graphs of square order and in Peisert graphs
-
LRCS: Duality, LP bounds, and field size
Abstract We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code’s...
- On anti-collusion codes for averaging attack in multimedia fingerprinting
- Codes over an infinite family of local rings of order $$2^{5^k}$$ with two Gray maps
- Self-dual matrix codes over Galois rings
- Codes with symmetric distances
- New constructions of optimal symbol-pair constacyclic codes of length $$4p^s$$
- Weights of a class of projective geometry codes
- On the conjecture about the nonexistence of homogeneous rotation symmetric bent functions
-
On group codes arising from Paley-type partial difference sets and skew–Hadamard difference sets
Abstract Paley-type partial difference sets and skew–Hadamard difference sets are classical objects in algebraic combinatorics, known for their rich connections with graph theory, coding theory, and group theory. In this paper, we...
-
Generalized hyperderivative Reed–Solomon codes
Abstract This article introduces Generalized Hyperderivative Reed–Solomon codes (GHRS codes), which generalize NRT Reed–Solomon codes. Its main results are as follows: (1) every GHRS code is MDS, (2) the dual of a GHRS code is also an...
- LRC codes over characteristic 2
- A generic construction on self-orthogonal algebraic geometric codes and its applications
- On the hulls of group codes
-
Perfect codes in Cayley graphs of abelian groups
Abstract A perfect code in a graph $$\Gamma = (V, E)$$ Γ = ( V , E ) is a subset C of V such that no two vertices in C are adjacent and every vertex in $$V \setminus C$$ V \ C is adjacent to exactly one vertex in C . A total perfect...
- On a conjecture about the sum-freedom of the binary multiplicative inverse function
- Quasi-cyclic binary extended and expurgated Goppa codes and their parameters
- A hybrid of lattice-reduction and Meet-LWE via near-collision on babai’s plane
-
Further results on a family of bent functions from permutations
Abstract In 1997, Hou and Langevin introduced the idea of constructing bent functions as the composition of a Boolean function with a permutation. Recently, K. Li, C. Li, T. Helleseth, and L. Qu constructed several classes of bent...
- Weightwise almost perfectly balanced functions, construction from a permutation group action view
-
Duals of multiplicity codes
Abstract Multivariate multiplicity codes have been recently explored because of their importance for list decoding and local decoding. Given a multivariate multiplicity code, in this paper, we compute its dimension using Gröbner basis...
- Binary code generated by the hyperbolic quadrics of $$W(2n-1,q),$$ q even
- On generalized Howell designs with block size four and their applications to multiply constant-weight codes