Skip to main content
Log in

Quantum synchronizable codes from the Whiteman’s generalized cyclotomy

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

Quantum synchronizable codes (QSCs) are special quantum error-correcting codes that can correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this paper, using the factorizations of cyclotomic polynomials \({{\varPhi }}_{p_{1}p_{2}}(x)\), where p1 and p2 are distinct odd primes, we give a new method to construct QSCs whose synchronization capabilities can reach the best attainable tolerance against misalignment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symb. Comput. 24, 235–265 (1997)

    Article  MathSciNet  Google Scholar 

  2. Ding, C.: Cyclotomic constructions of cyclic codes with length being the product of two primes. IEEE Trans. Inf. Theory 58(4), 2231–2236 (2012)

    Article  MathSciNet  Google Scholar 

  3. Lidl, R., Niedereiter, H.: Finite Fields. 20 of Encyclopedia of Mathematics and Its Applications. Addison-Wesley, Reading, MA (1983)

    Google Scholar 

  4. Fujiwara, Y.: Block synchronization for quantum information. Rev. A, Gen. Phys. 87(2), 109–120 (2013)

    Google Scholar 

  5. Fujiwara, Y., Tonchev, V.D., Wong, T.W.H.: Algebraic techniques in designing quantum synchronizable codes. Phys. Rev. A Gen. Phys. 88(1), 012318 (2013)

    Article  Google Scholar 

  6. Li, L., Zhu, S., Liu, L.: Quantum synchronizable codes from the cyclotomy of order four. IEEE Commun. Lett. 23(1), 12–15 (2019)

    Article  Google Scholar 

  7. Luo, L., Ma, Z.: Non-binary quantum synchronizable codes from repeated-root cyclic codes. IEEE Trans. Inf. Theory 64(3), 1461–1470 (2018)

    Article  MathSciNet  Google Scholar 

  8. Xie, Y., Yuan, J., Fujiwara, Y.: Quantum synchronizable codes from quadratic residue codes and their supercodes, Proc. IEEE Inf. Theory Workshop (ITW), 172–176 (2014)

  9. Xie Y., Yang L., Yuan J.: Q-ary chain-containing quantum synchronizable codes. IEEE Commun. Lett. 20(3), 414–417 (2016)

    Article  Google Scholar 

  10. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes 2nd edn. Amsterdam, The Netherlands: North Holland (1978)

  11. Whiteman, A.L.: A family of difference sets, Illinois. J. Math. 6, 107–121 (1962)

    MathSciNet  MATH  Google Scholar 

  12. Wu, Y., Yue, Q., Fan, S.: Self-reciprocal and self-conjugate-reciprocal irreducible factors of xnλ and their applications. Finite Fields Appl. 63, 101648 (2020)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors sincerely thank the reviewers and the editor for their helpful comments and valuable suggestions, which have greatly improved the presentation of this article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qin Yue.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

Let p be an odd prime with p ≡ 1 (mod 4), \((\frac {\cdot }{p})_{4}\) denotes the quartic residue symbol. In fact, let a be an integer with \(\gcd (a,p)=1\) and \((\frac qp)=1\), then \((\frac {a}{p})_{4}=1\) if and only if x4a (mod p) has a solution over \(\mathbb {Z}\); \((\frac {a}{p})_{4}=-1\) if and only if x4a (mod p) has not any solution over \(\mathbb {Z}\).

Proposition 4

For p1 ≡ 1 (mod 4) and p2 ≡ 3 (mod 4). Suppose that \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})=1\).

  1. 1.

    Then \({{\varPhi }}_{p_{2}}(x)\) has not any self-reciprocal irreducible factor over \(\mathbb {F}_{q}\).

  2. 2.

    If p1 ≡ 5 (mod 8) and \((\frac {q}{p_{1}})_{4}=1\), then \({{\varPhi }}_{p_{1}}(x)\) has not any self-reciprocal irreducible factor over \(\mathbb {F}_{q}\).

  3. 3.

    If p1 ≡ 5 (mod 8) and \((\frac {q}{p_{1}})_{4}=-1\), then \({{\varPhi }}_{p_{1}}(x)\) has a self-reciprocal irreducible factor over \(\mathbb {F}_{q}\).

Proof

Since \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})\), qW0 and qgt (mod n), so qgt (mod p1) and qgt (mod p2). Hence t is even by \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})=1\).

  1. 1.

    By p2 ≡ 3 (mod 4), ord\(_{p_{2}}(q)\) is odd. Then qs ≡− 1 (mod p2) does not hold. Hence \({{\varPhi }}_{p_{2}}(x)\) has not any self-reciprocal irreducible factor over \(\mathbb {F}_{q}\) by Lemma 4.

  2. 2.

    Since \((\frac {q}{p_{1}})_{4}=1\), 4|t; by p1 ≡ 5 (mod 8), ord\(_{p_{1}}(q)\) is odd. By ord\(_{p_{1}}(-1)=2\), qs ≡− 1 (mod p1) does not hold. Hence \({{\varPhi }}_{p_{1}}(x)\) has not any self-reciprocal irreducible factor over \(\mathbb {F}_{q}\) by Lemma 4.

  3. 3.

    Since \((\frac {q}{p_{1}})_{4}=-1\), 2∥t; by p1 ≡ 5 (mod 8), ord\(_{p_{1}}(q)\) is even. Then there is an integer s such that qs ≡− 1 (mod p1). Hence \({{\varPhi }}_{p_{1}}(x)\) has a self-reciprocal irreducible factor over \(\mathbb {F}_{q}\) by Lemma 4.

Proposition 5

For p1 ≡ 1 (mod 4) and p2 ≡ 3 (mod 4). Suppose that \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})=-1\). Then \({{\varPhi }}_{p_{1}}(x)\) and \({{\varPhi }}_{p_{2}}(x)\) have self-reciprocal irreducible factor over \(\mathbb {F}_{q}\).

Proof

Since \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})\), qW0 and qgt (mod n), so qgt (mod p1). Hence t is odd due to \((\frac {q}{p_{1}})=-1\). Furthermore, ord\(_{p_{1}}(q)=\frac {p_{1}-1}{\gcd (p_{1}-1,t)}\) is even. Then there is an integer s such that qs ≡− 1 (mod p1). Hence \({{\varPhi }}_{p_{1}}(x)\) has a self-reciprocal irreducible factor over \(\mathbb {F}_{q}\) by Lemma 4

Similarly, \({{\varPhi }}_{p_{2}}(x)\) has self-reciprocal irreducible factor over \(\mathbb {F}_{q}\). □

Proposition 6

For p1 ≡ 3 (mod 4) and p2 ≡ 3 (mod 4). Suppose that \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})=-1\). Then \({{\varPhi }}_{p_{1}}(x)\), \({{\varPhi }}_{p_{2}}(x)\), and \({{\varPhi }}_{p_{1}p_{2}}(x)\) have self-reciprocal irreducible factor over \(\mathbb {F}_{q}\).

Proof

Suppose that \((\frac {q}{p_{1}})=(\frac {q}{p_{2}})=-1\). Then ord\(_{p_{1}}(q)\) and ord\(_{p_{2}}(q)\) are even, thus ord\(_{p_{1}p_{2}}(q)\) is also even. Then \(q^{s_{i}}\equiv -1\pmod {p_{i}},i=1,2,\) and qt ≡− 1 (mod p1p2) hold for some integer s1,s2,t. By Lemma 4, \({{\varPhi }}_{p_{1}}(x)\), \({{\varPhi }}_{p_{2}}(x)\), and \({{\varPhi }}_{p_{1}p_{2}}(x)\) have self-reciprocal irreducible factor over \(\mathbb {F}_{q}\). □

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, X., Yue, Q. & Huang, X. Quantum synchronizable codes from the Whiteman’s generalized cyclotomy. Cryptogr. Commun. 13, 727–739 (2021). https://doi.org/10.1007/s12095-021-00501-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-021-00501-2

Keywords

Mathematics Subject Classification (2010)