Certain diagonal equations and conflict-avoiding codes of prime lengths
From MaRDI portal
Publication:6063249
DOI10.1016/J.FFA.2023.102298arXiv2302.00920OpenAlexW4386620893MaRDI QIDQ6063249
Wei-Liang Sun, Hua-Chieh Li, Liang-Chung Hsia
Publication date: 7 November 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.00920
conflict-avoiding codediagonal equationHasse-Weil boundRamanujan's sumFibonacci primitive rootbinary protocol sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- A new series of optimal tight conflict-avoiding codes of weight 3
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Conflict-avoiding codes and cyclic triple systems
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- A problem analogous to Artin's conjecture for primitive roots and its applications
- Some constructions of conflict-avoiding codes
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- The evaluation of Ramanujan's sum and generalizations
- A class of codes for a T active users out of N multiple-access communication system
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Constructions of protocol sequences for multiple access collision channel without feedback
- Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Sums of Powers of Numbers Having a Given Exponent Modulo a Prime
This page was built for publication: Certain diagonal equations and conflict-avoiding codes of prime lengths
