Linear (2, pp)-AONTs exist for all primes p

  • Xin WangEmail author
  • Jie Cui
  • Lijun Ji


A (tsv)-all-or-nothing transform (AONT) is a bijective mapping defined on s-tuples over an alphabet of size v, which satisfies that if any \(s-t\) of the s outputs are given, then the values of any t inputs are completely undetermined. When t and v are fixed, to determine the maximum integer s such that a (tsv)-AONT exists is the main research objective. In this paper, we solve three open problems proposed in Nasr Esfahani et al. (IEEE Trans Inf Theory 64:3136–3143, 2018) and show that there do exist linear (2, pp)-AONTs. Then for the size of the alphabet being a prime power, we give the first infinite class of linear AONTs which is better than the linear AONTs defined by Cauchy matrices. Besides, we also present a recursive construction for general AONTs and a new relationship between AONTs and orthogonal arrays.


All-or-nothing transforms Invertible matrices Cyclic codes Product construction Orthogonal arrays 

Mathematics Subject Classification

94A60 11T71 05B15 



  1. 1.
    Bose R.C., Shrikhande S.S., Parker E.T.: Further results on the construction of mutually orthogonal latin squares and the falsity of Euler’s conjecture. Can. J. Math. 12, 189–203 (1960).MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    D’Arco P., Nasr Esfahani N., Stinson D.R.: All or nothing at all. Electron. J. Combin. 23(4), paper P4.10 (2016).Google Scholar
  3. 3.
    Great Internet Mersenne Prime Search. Accessed 8 April 2018.
  4. 4.
    Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).CrossRefzbMATHGoogle Scholar
  5. 5.
    Nasr Esfahani N., Stinson D.R.: Computational results on invertible matrices with the maximum number of invertible \(2\)-by-\(2\) submatrices. Aust. J. Comb. 69, 130–144 (2017).zbMATHGoogle Scholar
  6. 6.
    Nasr Esfahani N., Goldberg I., Stinson D.R.: Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. IEEE Trans. Inf. Theory 64, 3136–3143 (2018).MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Rivest R.L.: All-or-nothing encryption and the package transform. Fast Software Encryption (Lecture Notes in Computer Science) 1267, 210–218 (1997).Google Scholar
  8. 8.
    Stinson D.R.: Something about all or nothing (transforms). Des. Codes Cryptogr. 22, 133–138 (2001).MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Zhang Y., Zhang T., Wang X., Ge G.: Invertible binary matrices with maximum number of \(2\)-by-\(2\) inverible submatrices. Discret. Math. 340, 201–208 (2017).CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of MathematicsSoochow UniversitySuzhouChina

Personalised recommendations