DLDanni Lu
Danni Lu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Danni Lu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Minjia Shi
Key Laboratory of Intelligent Computing Signal Processing, Ministry of Education, School of Mathematical Sciences, Anhui University, Hefei, China
4 shared publications - Patrick Solé
I2M (CNRS, University of Aix-Marseille), Marseilles, France
3 shared publications - Ronan Egan
School of Mathematical Sciences, Dublin City University, Dublin, Ireland
3 shared publications - Ferruh Özbudak
FENS, Sabancı University, Istanbul, Turkey
2 shared publications - José Andrés Armario
Departamento de Matemática Aplicada I, Universidad de Sevilla, Sevilla, Spain
2 shared publications
Latest Publications
- 27 October 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (3) , 1-26
Hadamard bent sequences and spherical designs
- 27 October 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (3) , 1-26
Hadamard bent sequences and spherical designs
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (4) , 1010-1025
Quasi-twisted codes as invariant subspaces
Quasi-twisted codes extend the concept of quasi-cyclic codes, offering a rich algebraic structure relative to general linear codes and demonstrating strong asymptotic properties. This paper investigates the algebra properties of quasi-twisted codes over the finite field $ \mathbb{F}_q, $ treating them as invariant subspaces under a specific linear transformation. We also establish a lower bound for the minimum distance of $ 1 $-generator quasi-twisted codes, which in some cases exceeds the known BCH-type bound.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (4) , 1010-1025
Quasi-twisted codes as invariant subspaces
Quasi-twisted codes extend the concept of quasi-cyclic codes, offering a rich algebraic structure relative to general linear codes and demonstrating strong asymptotic properties. This paper investigates the algebra properties of quasi-twisted codes over the finite field $ \mathbb{F}_q, $ treating them as invariant subspaces under a specific linear transformation. We also establish a lower bound for the minimum distance of $ 1 $-generator quasi-twisted codes, which in some cases exceeds the known BCH-type bound.- Open Access
- 22 October 2024
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 112 (1) , 14-22
COMPLEX WEIGHING MATRICES AND QUATERNARY CODES
Weighing matrices with entries in the complex cubic and sextic roots of unity are employed to construct Hermitian self-dual codes and Hermitian linear complementary dual codes over the finite field $\mathrm {GF}(4).$ The parameters of these codes are explored for small matrix orders and weights.- 22 October 2024
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 112 (1) , 14-22
Open AccessCOMPLEX WEIGHING MATRICES AND QUATERNARY CODES
Weighing matrices with entries in the complex cubic and sextic roots of unity are employed to construct Hermitian self-dual codes and Hermitian linear complementary dual codes over the finite field $\mathrm {GF}(4).$ The parameters of these codes are explored for small matrix orders and weights. - Open Access
Butson Hadamard matrices, bent sequences, and spherical codes
We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order $n$ defined over the complex $q^{th}$ roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of order $q.$ In particular we construct self-dual bent sequences for various $q\le 60$ and lengths $n\le 21.$ Computational construction methods comprise the resolution of polynomial systems by Groebner bases and eigenspace computations. Infinite families can be constructed from regular Hadamard matrices, Bush-type Hadamard matrices, and generalized Boolean bent functions.As an application, we estimate the covering radius of the code attached to that matrix over $\Z_q.$ We derive a lower bound on that quantity for the Chinese Euclidean metric when bent sequences exist. We give the Euclidean distance spectrum, and bound above the covering radius of an attached spherical code, depending on its strength as a spherical design.Open AccessButson Hadamard matrices, bent sequences, and spherical codes
We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order $n$ defined over the complex $q^{th}$ roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of order $q.$ In particular we construct self-dual bent sequences for various $q\le 60$ and lengths $n\le 21.$ Computational construction methods comprise the resolution of polynomial systems by Groebner bases and eigenspace computations. Infinite families can be constructed from regular Hadamard matrices, Bush-type Hadamard matrices, and generalized Boolean bent functions.As an application, we estimate the covering radius of the code attached to that matrix over $\Z_q.$ We derive a lower bound on that quantity for the Chinese Euclidean metric when bent sequences exist. We give the Euclidean distance spectrum, and bound above the covering radius of an attached spherical code, depending on its strength as a spherical design.