{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:50:46Z","timestamp":1762033846174},"reference-count":9,"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\/bf03253305","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:22Z","timestamp":1625639602000},"page":"1045-1052","source":"Crossref","is-referenced-by-count":5,"title":["Turbo codes with modified welch-costas interleavers"],"prefix":"10.1007","volume":"62","author":[{"given":"Lucian","family":"Trifina","sequence":"first","affiliation":[]},{"given":"Valeriu","family":"Munteanu","sequence":"additional","affiliation":[]},{"given":"Daniela","family":"Tarniceriu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03253305_CR1","first-page":"1064","volume-title":"Proc. Oficc","author":"C. Berrou","year":"1993","unstructured":"Berrou C., Glavieux A., Thitimajshima P., Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes, Proc. Oficc, Geneva, Switzerland, pp. 1064\u20131070, May 1993."},{"key":"BF03253305_CR2","first-page":"1692","volume":"50","author":"M. Breiling","year":"2004","unstructured":"Breiling M., A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes, IEEE Trans. On Inf. Theory, 50, no 8, pp. 1692\u20131710, 2004.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253305_CR3","first-page":"2985","volume":"50","author":"A. Perotti","year":"2004","unstructured":"Perotti A., Benedetto S., A New Upper Bound on the Minimum Distance of Turbo Codes, IEEE Trans. On Inf. Theory, 50, no 12, pp. 2985\u20132997, 2004.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253305_CR4","volume-title":"Kluwer Academic Publishers","author":"C. Heegard","year":"1999","unstructured":"Heegard C, Wicker S. B., Turbo Coding, Kluwer Academic Publishers, Dordrecht, the Netherlands, 1999."},{"key":"BF03253305_CR5","first-page":"42","volume-title":"JPL TDA Progress Report","author":"S. Dolinar","year":"1995","unstructured":"Dolinar S., Divsalar D., Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations, JPL TDA Progress Report, pp. 42\u2013122, 1995."},{"key":"BF03253305_CR6","first-page":"54","volume":"1","author":"D. Divsalar","year":"1995","unstructured":"Divsalar D., Pollara F., Turbo Codes for pes Applications, Proc. of IEEE Conf ofComm., Washington, 1, pp. 54\u201359, June 1995.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253305_CR7","volume-title":"Editura Did\u00e1ctica si Pedag\u00f3gica","author":"C. Popovici","year":"1973","unstructured":"Popovici C, Teoria numerelor, Editura Did\u00e1ctica si Pedag\u00f3gica, Bucuresti, Romania, 1973."},{"key":"BF03253305_CR8","first-page":"800","volume":"19","author":"R. Garello","year":"2001","unstructured":"Garello R., Pierleoni P., Bipenedetto S., Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleaves: Algorithms and Applications, IEEE J. on Selected Areas in Comm., 19, no 5, pp. 800\u2013812, 2001.","journal-title":"Annales Des T\u00e9l\u00e9communications"},{"key":"BF03253305_CR9","first-page":"1413","volume":"42","author":"L. Trifina","year":"2006","unstructured":"Trifina L., Munteanu V., Tarniceriu D., Welch Costas interleaver with cyclic shifts on groups of elements, IEE Electronics Letters, 42, no 24, pp. 1413\u20131415, nov.2006.","journal-title":"Annales Des T\u00e9l\u00e9communications"}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03253305.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF03253305\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03253305.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T07:27:50Z","timestamp":1625642870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF03253305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":9,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["BF03253305"],"URL":"https:\/\/doi.org\/10.1007\/bf03253305","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}