[{"status":"public","oa":1,"language":[{"iso":"eng"}],"author":[{"full_name":"Ahlswede, Rudolf","id":"10479","autoren_ansetzung":["Ahlswede, Rudolf","Ahlswede","Rudolf Ahlswede","Ahlswede, R","Ahlswede, R.","R Ahlswede","R. Ahlswede"],"last_name":"Ahlswede","first_name":"Rudolf"},{"first_name":"L. A.","last_name":"Bassalygo","autoren_ansetzung":["Bassalygo, L. A.","Bassalygo","L. A. Bassalygo","Bassalygo, L","Bassalygo, L.","L Bassalygo","L. Bassalygo","Bassalygo L.A.","Bassalygo, L.A.","Bassalygo L. A.","Bassalygo, L. A.","Bassalygo L..A.","Bassalygo, L..A.","Bassalygo L.. A.","Bassalygo, L.. A."],"full_name":"Bassalygo, L. A."},{"first_name":"M. S.","autoren_ansetzung":["Pinsker, M. S.","Pinsker","M. S. Pinsker","Pinsker, M","Pinsker, M.","M Pinsker","M. Pinsker","Pinsker M.S.","Pinsker, M.S.","Pinsker M. S.","Pinsker, M. S.","Pinsker M..S.","Pinsker, M..S.","Pinsker M.. S.","Pinsker, M.. S."],"last_name":"Pinsker","full_name":"Pinsker, M. S."}],"year":"1995","date_submitted":"2010-11-11T10:21:22Z","volume":"31","title":"Asymptotically optimal binary codes of polynomial complexity correcting localized errors","issue":"2","citation":{"frontiers":"Ahlswede, R., Bassalygo, L. A., and Pinsker, M. S. (1995). Asymptotically optimal binary codes of polynomial complexity correcting localized errors. *Probl. Peredachi Inf.* 31, 76-83.","lncs":" Ahlswede, R., Bassalygo, L.A., Pinsker, M.S.: Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 31, 76-83 (1995).","apa":"Ahlswede, R., Bassalygo, L. A., & Pinsker, M. S. (1995). Asymptotically optimal binary codes of polynomial complexity correcting localized errors. *Probl. Peredachi Inf.*, *31*(2), 76-83.","angewandte-chemie":"R. Ahlswede, L. A. Bassalygo, and M. S. Pinsker, “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”, *Probl. Peredachi Inf.*, **1995**, *31*, 76-83.","wels":"Ahlswede, R.; Bassalygo, L. A.; Pinsker, M. S. (1995): Asymptotically optimal binary codes of polynomial complexity correcting localized errors *Probl. Peredachi Inf.*,31:(2): 76-83.","harvard1":"Ahlswede, R., Bassalygo, L.A., & Pinsker, M.S., 1995. Asymptotically optimal binary codes of polynomial complexity correcting localized errors. *Probl. Peredachi Inf.*, 31(2), p 76-83.","aps":" R. Ahlswede, L. A. Bassalygo, and M. S. Pinsker, Asymptotically optimal binary codes of polynomial complexity correcting localized errors, Probl. Peredachi Inf. **31**, 76 (1995).","default":"Ahlswede R, Bassalygo LA, Pinsker MS (1995)

*Probl. Peredachi Inf.* 31(2): 76-83.","mla":"Ahlswede, Rudolf, Bassalygo, L. A., and Pinsker, M. S. “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”. *Probl. Peredachi Inf.* 31.2 (1995): 76-83.","dgps":"Ahlswede, R., Bassalygo, L.A. & Pinsker, M.S. (1995). Asymptotically optimal binary codes of polynomial complexity correcting localized errors. *Probl. Peredachi Inf.*, *31*(2), 76-83.

","bio1":"Ahlswede R, Bassalygo LA, Pinsker MS (1995)

Asymptotically optimal binary codes of polynomial complexity correcting localized errors.

Probl. Peredachi Inf. 31(2): 76-83.","chicago":"Ahlswede, Rudolf, Bassalygo, L. A., and Pinsker, M. S. 1995. “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”. *Probl. Peredachi Inf.* 31 (2): 76-83.

","ieee":" R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”, *Probl. Peredachi Inf.*, vol. 31, 1995, pp. 76-83.","apa_indent":"Ahlswede, R., Bassalygo, L. A., & Pinsker, M. S. (1995). Asymptotically optimal binary codes of polynomial complexity correcting localized errors. *Probl. Peredachi Inf.*, *31*(2), 76-83.

","ama":"Ahlswede R, Bassalygo LA, Pinsker MS. Asymptotically optimal binary codes of polynomial complexity correcting localized errors. *Probl. Peredachi Inf.* 1995;31(2):76-83."},"ddc":["510"],"first_author":"Ahlswede, Rudolf","article_type":"original","department":[{"_id":"10020"}],"publication":"Probl. Peredachi Inf.","date_created":"2018-07-24T12:59:14Z","type":"journal_article","file":[{"access_level":"open_access","date_updated":"1970-01-01T00:00:00Z","file_id":"2312957","date_created":"1970-01-01T00:00:00Z","content_type":"application/pdf","file_name":"Ahlswede_97.pdf","relation":"main_file","open_access":"1"}],"urn":"urn:nbn:de:0070-bipr-21455","file_date_updated":"1970-01-01T00:00:00Z","id":"1780563","page":"76-83","date_updated":"2018-07-24T12:59:14Z","publication_status":"published","_id":"1780563","abstract":[{"lang":"eng","text":"The asymptotically optimal transmission rate of binary codes correcting localized errors is known when the number of errors grows linearly in the code length. Here we prove that this rate can be attained by codes with polynomial complexity of encoding, decoding, and code construction."}],"keyword":["Codierungstheorie"],"accept":"1","intvolume":" 31"}]