Skip to main content
SpringerLink
Log in

On error correction with errors in both the channel and syndrome

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We address the problem of error correction by linear block codes under the assumption that the syndrome of a received vector is found with errors. We propose a construction of parity-check matrices which allow to solve the syndrome equation even with an erroneous syndrome, in particular, parity-check matrices with minimum redundancy, which are analogs of Reed-Solomon codes for this problem. We also establish analogs of classical coding theory bounds, namely the Hamming, Singleton, and Gilbert-Varshamov bounds. We show that the new problem can be considered as a generalization of the well-known Ulam’s problem on searching with a lie and as a discrete analog of the compressed sensing problem.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Prony, R., Essai expérimantal et analytique sur les lois de la Dilatabilité des fluides élastiques et sur celles de la Force expansive de la vapeur de l’eau et de la vapeur de l’alkool, à différentes températures, J. de l’Ecole Polytech. (Paris), 1795, vol. 1, no. 2, pp. 24–76.

    Google Scholar 

  2. Comer, M.T., Kaltofen, E.L., and Pernet, C., Sparse Polynomial Interpolation and Berlekamp/Massey Algorithms That Correct Outlier Errors in Input Values, in Proc. 37th Int. Sympos. on Symbolic and Algebraic Computation (ISSAC’2012), Grenoble, France, July 22–25, 2012, New York: ACM, 2012, pp. 138–145.

    Google Scholar 

  3. Ulam, S.M., Adventures of a Mathematician, New York: Scribner, 1976.

    Google Scholar 

  4. Donoho, D.L., Compressed Sensing, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 4, pp. 1289–1306.

    Article  MathSciNet  Google Scholar 

  5. Candes, E.J. and Tao, T., Near-Optimal Signal Recovery from Random Projections: Universal Encoding Strategies?, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 12, pp. 5406–5425.

    Article  MathSciNet  Google Scholar 

  6. Kashin, B.S. and Temlyakov, V.N., A Remark on the Problem of Compressed Sensing, Mat. Zametki, 2007, vol. 82, no. 6, pp. 829–837 [Math. Notes (Engl. Transl.), 2007, vol. 82, no. 5–6, pp. 748–755].

    Article  MathSciNet  Google Scholar 

  7. Kabatiansky, G. and Vlăduţ, S., What to Do if Syndroms Are Corrupted Also, in Proc. 7th Int. Workshop on Optimal Codes and Related Topics (OC’2013), Albena, Bulgaria, Sept. 6–12, 2013, pp. 102–106.

  8. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.

    Google Scholar 

  9. Milenkovic, O., private communication, 2011.

  10. Rivest, R.L., Meyer, A.R., Kleitman, D.J., Winkelmann, K., and Spencer, J., Coping with Errors in Binary Search Procedures, J. Comput. System Sci., 1980, vol. 20, no. 3, pp. 396–404.

    Article  MathSciNet  Google Scholar 

  11. Spencer, J., Guess a Number-with Lying, Math. Mag., 1984, vol. 57, no. 2, pp. 105–108.

    Article  MathSciNet  Google Scholar 

  12. Pelc, A., Solution of Ulam’s Problem on Searching with a Lie, J. Combin. Theory, Ser. A, 1987, vol. 44, no. 1, pp. 129–140.

    Article  MathSciNet  Google Scholar 

  13. Aigner, M., Searching with Lies, J. Combin. Theory, Ser. A, 1996, vol. 74, no. 1, pp. 43–56.

    Article  MathSciNet  Google Scholar 

  14. Malyutov, M., Search for Sparse Active Inputs: A Review, Information Theory, Combinatorics, and Search Theory-In Memory of Rudolf Ahlswede, Aydinian, H.K., Cicalese, F., and Deppe, C., Eds., Lect. Notes Comp. Sci, vol. 7777, New York: Springer, 2013, pp. 609–647.

    Chapter  Google Scholar 

  15. Lindström, B., On a Combinatorial Detection Problem. I, Magyar Tud. Akad. Mat. Kutató Int. Közl., 1964, vol. 9, pp. 195–207.

    Google Scholar 

  16. Cantor, D.G. and Mills, W.H., Determination of a Subset from Certain Combinatorial Properties, Canad. J. Math., 1966, vol. 18, pp. 42–48.

    Article  MathSciNet  Google Scholar 

  17. Donoho, D.L. and Elad, M., Optimally Sparse Representation in General (Nonorthogonal) Dictionaries via ℓ 1 Minimization, Proc. Natl. Acad. Sci. USA, 2003, vol. 100, no. 5, pp. 2197–2202.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    S. G. Vlǎduţ

  2. Institut de Mathématiques de Marseille, Aix-Marseille Université, IML, Marseille, France

    S. G. Vlǎduţ

  3. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    G. A. Kabatiansky & V. V. Lomakov

Authors
  1. S. G. Vlǎduţ
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. A. Kabatiansky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. V. Lomakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. G. Vlǎduţ.

Additional information

Original Russian Text © S.G. Vlǎduţ, G.A. Kabatiansky, V.V. Lomakov, 2015, published in Problemy Peredachi Informatsii, 2015, Vol. 51, No. 2, pp. 50–56.

The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vlǎduţ, S.G., Kabatiansky, G.A. & Lomakov, V.V. On error correction with errors in both the channel and syndrome. Probl Inf Transm 51, 132–138 (2015). https://doi.org/10.1134/S0032946015020040

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946015020040

Keywords

Search

Navigation