{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CSPS6XM44VBYDZ2GYNC62MCJJS","short_pith_number":"pith:CSPS6XM4","schema_version":"1.0","canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","source":{"kind":"arxiv","id":"1111.3820","version":2},"attestation_state":"computed","paper":{"title":"A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D. Kudryashov, Florian Hug, Irina E. Bocharova, Rolf Johannesson","submitted_at":"2011-11-16T14:38:21Z","abstract_excerpt":"In 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matrix G(D)=(1 1+D) when used to communicate over the binary symmetric channel. Their formula was later extended to the rate R=1/2, memory m=2 (4-state) convolutional encoder with generator matrix G(D)=(1+D^2 1+D+D^2) by Lentmaier et al.\n  In this paper, a different approach to derive the exact bit error probability is described. A general recurrent matrix equation, connecting the average information weight at the current"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1111.3820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T14:38:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9fc5ab35875d5c59bbd91743a8fad404a2fcea0b1289589ea7ca99ce3a249ad","abstract_canon_sha256":"af9c3531b1f9545c21e8a01ccdf56e377fe67e7129638e8e85a16ec126f6f9d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:34.492251Z","signature_b64":"gRF0KClNfVux38lXy927KgkvZGzO8g7+xV9vUZUdzJaME6uJmzZ3R7ztrA+Y7GJD2Oo45ynrxQhOujdAZV/tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","last_reissued_at":"2026-05-18T02:21:34.491735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:34.491735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D. Kudryashov, Florian Hug, Irina E. Bocharova, Rolf Johannesson","submitted_at":"2011-11-16T14:38:21Z","abstract_excerpt":"In 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matrix G(D)=(1 1+D) when used to communicate over the binary symmetric channel. Their formula was later extended to the rate R=1/2, memory m=2 (4-state) convolutional encoder with generator matrix G(D)=(1+D^2 1+D+D^2) by Lentmaier et al.\n  In this paper, a different approach to derive the exact bit error probability is described. A general recurrent matrix equation, connecting the average information weight at the current"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3820","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.3820","created_at":"2026-05-18T02:21:34.491836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3820v2","created_at":"2026-05-18T02:21:34.491836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3820","created_at":"2026-05-18T02:21:34.491836+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSPS6XM44VBY","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSPS6XM44VBYDZ2G","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSPS6XM4","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS","json":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS.json","graph_json":"https://pith.science/api/pith-number/CSPS6XM44VBYDZ2GYNC62MCJJS/graph.json","events_json":"https://pith.science/api/pith-number/CSPS6XM44VBYDZ2GYNC62MCJJS/events.json","paper":"https://pith.science/paper/CSPS6XM4"},"agent_actions":{"view_html":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS","download_json":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS.json","view_paper":"https://pith.science/paper/CSPS6XM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3820&json=true","fetch_graph":"https://pith.science/api/pith-number/CSPS6XM44VBYDZ2GYNC62MCJJS/graph.json","fetch_events":"https://pith.science/api/pith-number/CSPS6XM44VBYDZ2GYNC62MCJJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/action/storage_attestation","attest_author":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/action/author_attestation","sign_citation":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/action/citation_signature","submit_replication":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/action/replication_record"}},"created_at":"2026-05-18T02:21:34.491836+00:00","updated_at":"2026-05-18T02:21:34.491836+00:00"}