The diophantine equation x^ 2=4q^a/2+4q+1, with an application to coding theory

DOI10.1016/0022-314X(87)90099-0MaRDI QIDQ1087901zbMATH OpenFDO

Authors John Wolfskill, Nikos Tzanakis

Publication date 1987

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-314X(87)90099-0

zbMATH Keywords

[n,k code]dual codenonpolynomial equations

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Linear codes (general theory) (94B05)

Review text

Let q be a prime power, and x, m positive integers. Using the combination of a method of \textit{F. Beukers} [Acta Arith. 38, 389-410 (1981; Zbl 0371.10014)] with congruence arguments and with a method using second order recurrence sequences it is proved that the only solutions of the equation \(x^ 2=4q^ m+4q+1\) are \(m=2\), \(x=2q+1\); \(q=3\), \((m,x)=(1,5)\) and (3,11) as well as the solutions of the equation \(x^ 2=4q^ m+4q^ 2+1\) with m odd are \(m=1\), \(x=2q+1\) and \(q=2\), \((m,x)=(1,5)\), (3,7) and (7,23). A consequence of the above result is that the only possible parameters of an [n,k] code over the finite field GF(q) with exactly two non-zero weights \(w_ 1\) and \(w_ 2\) and with the property that the minimum weight of the dual code is at least 4 are the following: \[ \begin{alignedat}{5} \text{for any }q&: &\qquad& k=2,&\qquad& n=2,&& w_ 1=1,&& w_ 2=2, \\ & && k=4,&& n=q^ 2+1,&\qquad& w_ 1=(q-1)q,&\qquad& w_ 2=q^ 2; \\ q=2&, && &&n=2^{k-1},&& w_ 1=2^{k-2},&& w_ 2=2^{k-1}; \\ q=3&, && k=5,&& n=11,&& w_ 1=6,&& w_2=9, \\ & && k=6,&& n=56,&& w_ 1=1,&& w_ 2=2; \\ q=4&, && k=6,&& n=78,&& w_ 1=56,&& w_ 2=64, \\ & && k=7,&& n=430,&& w_ 1=320,&& w_ 2=352; \\ q=2^ m&,&& k=3,&& n=2^ m+2,&& w_ 1=2^ m,&& w_ 2=2^ m+2.\end{alignedat} \] The authors confirm so a conjecture of \textit{R. Calderbank} [J. Lond. Math. Soc., II. Ser. 26, 365-384 (1982; Zbl 0545.94014)].

Recommendations

• On the diophantine equation 𝑥²=4𝑞^{𝑚}-4𝑞ⁿ+1
• On the diophantine equation \(x^2+D=4y^q\)
• THE DIOPHANTINE EQUATION IN QUADRATIC NUMBER FIELDS
• The Diophantine Equation x 2 = 4q n + 4q m + 1
• A NOTE ON THE DIOPHANTINE EQUATION
• On the Diophantine equation x^2+b^m=c^n with a^2+b^4=c^2
• On the diophantine equation \(x^ 2+D=4p^ n\)
• A note on the Diophantine equation \(x^2 + q^m = c^{2n}\)
• The diophantine equation x^ 2=4q^ n-4q+1
• On the Diophantine equation x^2+C=4y^n

Cites work

• On the Diophantine equation y^2-D=2ᵏ
• On the Diophantine equation y^2=4q^n+4q+1
• On the generalized Ramanujan-Nagell equation I
• On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
• PARTIAL QUADRANGLES
• The Integer Points on Three Related Elliptic Curves
• Two-weight ternary codes and the equation y^2=4 3^+13

Cited in

(13)

• On the Diophantine equation y^2=4q^n+4q+1
• On the diophantine equation \(x^ 2-D=4p^ n\)
• A survey of partial difference sets
• Some necessary conditions on the parameters of partial difference sets
• A note on the Diophantine equation \(x^2 =4p^n -4p^m +\ell^2\)
• Starting with gaps between k-free numbers
• On the diophantine equation 𝑥²=4𝑞^{𝑚}-4𝑞ⁿ+1
• On a Diophantine Equation Related to Perfect Codes
• On the generalized Ramanujan-Nagell equation D₁x^2-D₂=4p^n
• On the number of solutions to the generalized Ramanujan-Nagell equation x^2 - D = 4p^n
• On a conjecture of Ma
• On the generalized Pillai equation \(\pm a^{x}\pm b^{y}=c\)
• SPG-reguli, SPG-systems, BLT-sets and sets with the BLT-property

This page was built for publication: The diophantine equation \(x^ 2=4q^{a/2}+4q+1\), with an application to coding theory

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