Certain diagonal equations and conflict-avoiding codes of prime lengths

DOI10.1016/J.FFA.2023.102298MaRDI QIDQ6063249zbMATH OpenOpenAlexFDO

Authors Liang-Chung Hsia, Hua-Chieh Li, Wei-Liang Sun

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

zbMATH Keywords

binary protocol sequenceconflict-avoiding codediagonal equationFibonacci primitive rootHasse-Weil boundRamanujan's sum

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Combinatorial codes (94B25)

Abstract: We study the construction of optimal conflict-avoiding codes (CAC) from a number theoretical point of view. The determination of the size of optimal CAC of prime length $p$ and weight 3 is formulated in terms of the solvability of certain twisted Fermat equations of the form $g^2{X}^{ell}+g{Y}^{ell}+1=0$ over the finite field $mathbb{F}_p$ for some primitive root $g$ modulo $p.$ We treat the problem of solving the twisted Fermat equations in a more general situation by allowing the base field to be any finite extension field $mathbb{F}_q$ of $mathbb{F}_p.$ We show that for $q$ greater than a lower bound of the order of magnitude $O(el{l}^2)$ there exists a generator $g$ of $mathbb{F}_q^{imes}$ such that the equation in question is solvable over $mathbb{F}_q.$ Using our results we are able to contribute new results to the construction of optimal CAC of prime lengths and weight $3.$

Recommendations

• On a Diophantine Equation Related to Perfect Codes
• scientific article; zbMATH DE number 691493
• scientific article; zbMATH DE number 5679640
• Cyclotomy and duadic codes of prime lengths
• On diagonal equations over finite fields
• On diagonal equations over finite fields
• On diagonal equations over finite fields
• On certain diagonal equations over finite fields
• Self-orthogonal and self-dual codes constructed via combinatorial designs and Diophantine equations

Cites work

• A class of codes for a T active users out of N multiple-access communication system
• A new series of optimal tight conflict-avoiding codes of weight 3
• A problem analogous to Artin's conjecture for primitive roots and its applications
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Conflict-avoiding codes and cyclic triple systems
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Constructions of protocol sequences for multiple access collision channel without feedback
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3019705 (Why is no real title available?)
• scientific article; zbMATH DE number 3055095 (Why is no real title available?)
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• On Conflict-Avoiding Codes of Length n=4m for Three Active Users
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Some constructions of conflict-avoiding codes
• Sums of Powers of Numbers Having a Given Exponent Modulo a Prime
• The evaluation of Ramanujan's sum and generalizations

Cited in

(1)

• scientific article; zbMATH DE number 5679640 (Why is no real title available?)

This page was built for publication: Certain diagonal equations and conflict-avoiding codes of prime lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063249)