{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:09:13Z","timestamp":1648534153109},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/bf03253309","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:22Z","timestamp":1625639602000},"page":"1121-1142","source":"Crossref","is-referenced-by-count":0,"title":["Une nouvelle identit\u00e9 relative \u00e0 l\u2019\u00e9num\u00e9rateur de poids des codes binaires lin\u00e9aires en blocs"],"prefix":"10.1007","volume":"62","author":[{"given":"Patrick","family":"Tortelier","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF03253309_CR1","volume-title":"The theory of error correcting codes","author":"F. J. Mcwilliams","year":"1977","unstructured":"Mcwilliams F. J., Sloane N.J., The theory of error correcting codes, North Holland, 1977."},{"key":"BF03253309_CR2","first-page":"1570","volume":"48","author":"C. Di","year":"2002","unstructured":"Di C., Proletti D., Telatar I., Richardson T., Urbanke R., Finite length analysis of low-density parity-check codes, IEEE Transactions on Information Theory, vol. 48, pp. 1570\u20131579, 2002.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253309_CR3","first-page":"922","volume":"52","author":"M. Schwartz","year":"2006","unstructured":"Schwartz M., Vardy A., On the stopping distance and the stopping redundancy of codes, IEEE Transactions on Information Theory, vol. 52, pp. 922\u2013932, 2006.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253309_CR4","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/BF02997779","volume":"50","author":"P. Tortelier","year":"1995","unstructured":"Tortelier P., Sur l\u2019emploi de la transformation de Fourier pour l\u2019\u00e9num\u00e9ration de poids des codes lin\u00e9aires en blocs, Ann. T\u00e9l\u00e9commun., vol. 50, pp. 743\u2013751, 1995.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253309_CR5","first-page":"786","volume":"41","author":"I. Krasikov","year":"1995","unstructured":"Krasikov I., Litsyn S., On spectra of bch codes, IEEE Transactions on Information Theory, vol. 41, pp.786\u2013788, 1995.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253309_CR6","first-page":"1472","volume":"41","author":"I. Krasikov","year":"1995","unstructured":"Krasikov I., Litsyn S., On the accuracy of the binomial approximation to the distance distribution of codes, IEEE Transactions on Information Theory, vol.41, pp. 1472\u20131474, 1995.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253309_CR7","first-page":"229","volume":"36","author":"P. Sol\u00e9","year":"1990","unstructured":"Sol\u00e9 P., A limit law on the distance distribution of binary codes, IEEE Transactions on Information Theory, vol. 36, pp. 229\u2013232, 1990.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253309_CR8","volume-title":"Results on parity checks matrices with optimal stopping and\/or deadend set enumerators","author":"J.H. Weber","year":"2006","unstructured":"Weber J.H., Abdel-Ghaffar K.: Results on parity checks matrices with optimal stopping and\/or deadend set enumerators, preprint, arXiv:cs.IT\/0607024 v1 (submitted to IEEE Transactions on Information Theory, July 2006)"},{"key":"BF03253309_CR9","volume-title":"The Stopping Redundancy Hierarchy of Cyclic Codes","author":"T. Hehn","year":"2006","unstructured":"Hehn T., Laendner S., Milenkovic O., Huber J. B., The Stopping Redundancy Hierarchy of Cyclic Codes, Proceedings of 44th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, Sept. 2006."},{"key":"BF03253309_CR10","first-page":"11","volume-title":"Probl. Info. Transmission","author":"V.M. Sidelnikov","year":"1971","unstructured":"Sidelnikov V.M., Weight spectrum of binary Bose-Chaudhuri-Hocquenghem codes, Probl. Info. Transmission, pp. 11\u201317, 1971."}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03253309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF03253309\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03253309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T07:26:31Z","timestamp":1625642791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF03253309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":10,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["BF03253309"],"URL":"https:\/\/doi.org\/10.1007\/bf03253309","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}