{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4AFIEQNJXS6AF33G7C7BCSAMF3","short_pith_number":"pith:4AFIEQNJ","schema_version":"1.0","canonical_sha256":"e00a8241a9bcbc02ef66f8be11480c2eec8cc38da556014e20d83c8ffd27a2d2","source":{"kind":"arxiv","id":"1207.4680","version":3},"attestation_state":"computed","paper":{"title":"Reduced Complexity Super-Trellis Decoding for Convolutionally Encoded Transmission Over ISI-Channels","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Schenk, Fabian Schuh, Johannes B. Huber","submitted_at":"2012-07-19T14:19:02Z","abstract_excerpt":"In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly, i.e., enables efficient super-trellis decoding. By means of this matched non-linear trellis description we can significantly reduce the number of states needed for the receiver-side Viterbi algorithm to perform maximum-likelihood sequence estimation. Further complexity reduction is achieved using the concept of reduced-state sequence estimation."},"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":"1207.4680","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T14:19:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f8cd0ae155d7fc46ce20e64aa50033f5127de8080073a23e8745cfff97cdf45","abstract_canon_sha256":"b621edef0dd0012f80b7a2e3991821a3c71f70c55e509bab1d1e01520724e7fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:04.218939Z","signature_b64":"IOS7r56Gdc1vsZ4VIFqeSikNOp3uhVMunRv1P8QFfONfiT9YVfvZEBHWs1h+ByODpfAHi6NCe1wbTQCoM4vqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e00a8241a9bcbc02ef66f8be11480c2eec8cc38da556014e20d83c8ffd27a2d2","last_reissued_at":"2026-05-18T03:44:04.218259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:04.218259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced Complexity Super-Trellis Decoding for Convolutionally Encoded Transmission Over ISI-Channels","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Schenk, Fabian Schuh, Johannes B. Huber","submitted_at":"2012-07-19T14:19:02Z","abstract_excerpt":"In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly, i.e., enables efficient super-trellis decoding. By means of this matched non-linear trellis description we can significantly reduce the number of states needed for the receiver-side Viterbi algorithm to perform maximum-likelihood sequence estimation. Further complexity reduction is achieved using the concept of reduced-state sequence estimation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4680","kind":"arxiv","version":3},"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":"1207.4680","created_at":"2026-05-18T03:44:04.218360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4680v3","created_at":"2026-05-18T03:44:04.218360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4680","created_at":"2026-05-18T03:44:04.218360+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AFIEQNJXS6A","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AFIEQNJXS6AF33G","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AFIEQNJ","created_at":"2026-05-18T12:26:53.410803+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/4AFIEQNJXS6AF33G7C7BCSAMF3","json":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3.json","graph_json":"https://pith.science/api/pith-number/4AFIEQNJXS6AF33G7C7BCSAMF3/graph.json","events_json":"https://pith.science/api/pith-number/4AFIEQNJXS6AF33G7C7BCSAMF3/events.json","paper":"https://pith.science/paper/4AFIEQNJ"},"agent_actions":{"view_html":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3","download_json":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3.json","view_paper":"https://pith.science/paper/4AFIEQNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4680&json=true","fetch_graph":"https://pith.science/api/pith-number/4AFIEQNJXS6AF33G7C7BCSAMF3/graph.json","fetch_events":"https://pith.science/api/pith-number/4AFIEQNJXS6AF33G7C7BCSAMF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3/action/storage_attestation","attest_author":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3/action/author_attestation","sign_citation":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3/action/citation_signature","submit_replication":"https://pith.science/pith/4AFIEQNJXS6AF33G7C7BCSAMF3/action/replication_record"}},"created_at":"2026-05-18T03:44:04.218360+00:00","updated_at":"2026-05-18T03:44:04.218360+00:00"}