{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "berrou-glavieux-thitimajshima-turbo-codes-1993",
    "title": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes",
    "summary": "Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation.\n\nA noisy message can be encoded twice, with the second encoder seeing its bits in a different order. Two decoders then exchange information about uncertain bits. Each tries to pass new evidence rather than simply repeating the same received information. This paper shows striking simulation performance for a carefully chosen code, channel, long interleaver and iteration schedule. The exchange is approximate: more iterations can worsen results at low signal levels, and long blocks require memory and delay. The result opens a powerful coding route without proving every such decoder reaches channel capacity.",
    "boundary": "Exact 1993 ICC conference paper 1064-1070/PDF 1-7 all original technical/annex/reference text read. Parallel recursive convolutional codes, interleaving and iterative extrinsic soft information use discrete Gaussian memoryless/binary-channel assumptions and approximate weak correlation/Gaussian feedback. Reported Monte Carlo uses rate 1/2, componentrate 2/3, constraintlength 5/16 states,65536-bit 256 x 256 interleaver,128 blocks and iterations up to 18. Close-to-limit headline is specific reported performance, not universal capacity/global convergence or hardware-efficiency proof. Low-SNR BER can worsen with iteration; weighting/interleaver choices and storage/delay matter. No exact headline Eb/N0 value or independently certified formula transcription is supplied here. Crossref date is null;1993 established by source copyright/conference identity. No independent certification.",
    "area": "Signal computation and communication",
    "topic": "Computing",
    "year": 1993,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "berrou-glavieux-thitimajshima-turbo-codes-1993",
    "target": {
      "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
      "version": 1,
      "content_hash": "sha256:526ec33ec1030eea9a5077f6dd05701b386d6f20d24ffdae56295b5b7343ba11"
    },
    "humans": [
      "Claude Berrou",
      "Alain Glavieux",
      "Punya Thitimajshima"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "viterbi-convolutional-decoding-1967",
      "shannon"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-turbo1993-original",
        "title": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
        "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf"
      },
      {
        "id": "wrs24-turbo1993-crossref",
        "title": "IEEE-deposited exact turbo-code conference identity",
        "url": "https://api.crossref.org/works/10.1109%2FICC.1993.397441"
      }
    ],
    "points": "260000",
    "published_grade": {
      "id": "berrou-glavieux-thitimajshima-turbo-codes-1993",
      "entry_id": "berrou-glavieux-thitimajshima-turbo-codes-1993",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
        "version": 1,
        "content_hash": "sha256:526ec33ec1030eea9a5077f6dd05701b386d6f20d24ffdae56295b5b7343ba11"
      },
      "what_changed": "Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation.",
      "scope": "Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation. Exact 1993 ICC conference paper 1064-1070/PDF 1-7 all original technical/annex/reference text read. Parallel recursive convolutional codes, interleaving and iterative extrinsic soft information use discrete Gaussian memoryless/binary-channel assumptions and approximate weak correlation/Gaussian feedback. Reported Monte Carlo uses rate 1/2, componentrate 2/3, constraintlength 5/16 states,65536-bit 256 x 256 interleaver,128 blocks and iterations up to 18. Close-to-limit headline is specific reported performance, not universal capacity/global convergence or hardware-efficiency proof. Low-SNR BER can worsen with iteration; weighting/interleaver choices and storage/delay matter. No exact headline Eb/N0 value or independently certified formula transcription is supplied here. Crossref date is null;1993 established by source copyright/conference identity. No independent certification.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
        "version": 1,
        "content_hash": "sha256:526ec33ec1030eea9a5077f6dd05701b386d6f20d24ffdae56295b5b7343ba11"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Claude Berrou",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
            "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Alain Glavieux",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
            "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Punya Thitimajshima",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
            "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
            "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "IEEE-deposited exact turbo-code conference identity",
            "url": "https://api.crossref.org/works/10.1109%2FICC.1993.397441"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Exact 1993 ICC conference paper 1064-1070/PDF 1-7 all original technical/annex/reference text read. Parallel recursive convolutional codes, interleaving and iterative extrinsic soft information use discrete Gaussian memoryless/binary-channel assumptions and approximate weak correlation/Gaussian feedback. Reported Monte Carlo uses rate 1/2, componentrate 2/3, constraintlength 5/16 states,65536-bit 256 x 256 interleaver,128 blocks and iterations up to 18. Close-to-limit headline is specific reported performance, not universal capacity/global convergence or hardware-efficiency proof. Low-SNR BER can worsen with iteration; weighting/interleaver choices and storage/delay matter. No exact headline Eb/N0 value or independently certified formula transcription is supplied here. Crossref date is null;1993 established by source copyright/conference identity. No independent certification.",
        "domain": "Signal computation and communication"
      },
      "sources": [
        {
          "citation": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
          "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf"
        },
        {
          "citation": "IEEE-deposited exact turbo-code conference identity",
          "url": "https://api.crossref.org/works/10.1109%2FICC.1993.397441"
        }
      ],
      "statement": "# Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes\n\nBerrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation.\n\nA noisy message can be encoded twice, with the second encoder seeing its bits in a different order. Two decoders then exchange information about uncertain bits. Each tries to pass new evidence rather than simply repeating the same received information. This paper shows striking simulation performance for a carefully chosen code, channel, long interleaver and iteration schedule. The exchange is approximate: more iterations can worsen results at low signal levels, and long blocks require memory and delay. The result opens a powerful coding route without proving every such decoder reaches channel capacity.\n\n## Scientific scope\n\nExact 1993 ICC conference paper 1064-1070/PDF 1-7 all original technical/annex/reference text read. Parallel recursive convolutional codes, interleaving and iterative extrinsic soft information use discrete Gaussian memoryless/binary-channel assumptions and approximate weak correlation/Gaussian feedback. Reported Monte Carlo uses rate 1/2, componentrate 2/3, constraintlength 5/16 states,65536-bit 256 x 256 interleaver,128 blocks and iterations up to 18. Close-to-limit headline is specific reported performance, not universal capacity/global convergence or hardware-efficiency proof. Low-SNR BER can worsen with iteration; weighting/interleaver choices and storage/delay matter. No exact headline Eb/N0 value or independently certified formula transcription is supplied here. Crossref date is null;1993 established by source copyright/conference identity. No independent certification.\n\n## People and systems\n\nClaude Berrou; Alain Glavieux; Punya Thitimajshima\n\n\n\n## Original sources\n\n- [Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text](https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf)\n- [IEEE-deposited exact turbo-code conference identity](https://api.crossref.org/works/10.1109%2FICC.1993.397441)\n",
      "summary": "Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation.\n\nA noisy message can be encoded twice, with the second encoder seeing its bits in a different order. Two decoders then exchange information about uncertain bits. Each tries to pass new evidence rather than simply repeating the same received information. This paper shows striking simulation performance for a carefully chosen code, channel, long interleaver and iteration schedule. The exchange is approximate: more iterations can worsen results at low signal levels, and long blocks require memory and delay. The result opens a powerful coding route without proving every such decoder reaches channel capacity.",
      "title": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes"
    },
    "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
      "version": 1,
      "content_hash": "sha256:526ec33ec1030eea9a5077f6dd05701b386d6f20d24ffdae56295b5b7343ba11"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:fc3405c62de2f397a333058670cf63ae1b82ef4d2a4351036b8dfec61e3a78f8"
  },
  "target": {
    "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
    "version": 1,
    "content_hash": "sha256:526ec33ec1030eea9a5077f6dd05701b386d6f20d24ffdae56295b5b7343ba11"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "berrou-glavieux-thitimajshima-turbo-codes-1993",
    "entry_id": "berrou-glavieux-thitimajshima-turbo-codes-1993",
    "revision": 1,
    "title": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes",
    "context": "Signal computation and communication",
    "track": "Signal computation and communication",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation.",
    "scope": "Berrou, Glavieux and Thitimajshima combine interleaved recursive convolutional encoders with iterative soft-information decoding and report close-to-channel-limit error performance under a specified long-block Gaussian-channel simulation. Exact 1993 ICC conference paper 1064-1070/PDF 1-7 all original technical/annex/reference text read. Parallel recursive convolutional codes, interleaving and iterative extrinsic soft information use discrete Gaussian memoryless/binary-channel assumptions and approximate weak correlation/Gaussian feedback. Reported Monte Carlo uses rate 1/2, componentrate 2/3, constraintlength 5/16 states,65536-bit 256 x 256 interleaver,128 blocks and iterations up to 18. Close-to-limit headline is specific reported performance, not universal capacity/global convergence or hardware-efficiency proof. Low-SNR BER can worsen with iteration; weighting/interleaver choices and storage/delay matter. No exact headline Eb/N0 value or independently certified formula transcription is supplied here. Crossref date is null;1993 established by source copyright/conference identity. No independent certification.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Berrou, Glavieux and Thitimajshima: iterative turbo error-correcting codes; exact original contribution text",
        "url": "https://archive.reu.dimacs.rutgers.edu/2008/alexo/public_html/turbo.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "IEEE-deposited exact turbo-code conference identity",
        "url": "https://api.crossref.org/works/10.1109%2FICC.1993.397441",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Claude Berrou",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Alain Glavieux",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Punya Thitimajshima",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:f210b25b-5792-4f6b-a82e-12a407a1fe80",
      "version": 1,
      "content_hash": "sha256:526ec33ec1030eea9a5077f6dd05701b386d6f20d24ffdae56295b5b7343ba11"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "260000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}