{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GPIN6V6FGGNZJ42CW7KKMSYIQL","short_pith_number":"pith:GPIN6V6F","schema_version":"1.0","canonical_sha256":"33d0df57c5319b94f342b7d4a64b0882d4b9141ca1242cfc5df5323b27ee74ed","source":{"kind":"arxiv","id":"1201.4428","version":1},"attestation_state":"computed","paper":{"title":"Error-Trellis Construction for Tailbiting Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Koji Okino, Masato Tajima","submitted_at":"2012-01-21T03:04:25Z","abstract_excerpt":"In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction of tailbiting backward error-trellises. Moreover, we obtain the scalar parity-check matrix for a tailbiting convolutional code. The proposed construction is based on the adjoint-obvious realization of a syndrome "},"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":"1201.4428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-21T03:04:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d48415bdb89b21da9d3a6b5023956d3c50ddcd81324f38beb1de7eb340ec3369","abstract_canon_sha256":"10c916f504b7422073e7a8c3d0b881ccb7f34df9c4194d4182d1662d3ac89516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:06.114755Z","signature_b64":"PP1AqEu2edTG04slBqb1+PPiAeYmov/yrnX1BOpy/bwHBD9xdKE5wZDZSNIS1+ArCQNcva8lDMya5ZzM6JRYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d0df57c5319b94f342b7d4a64b0882d4b9141ca1242cfc5df5323b27ee74ed","last_reissued_at":"2026-05-18T04:04:06.114242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:06.114242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-Trellis Construction for Tailbiting Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Koji Okino, Masato Tajima","submitted_at":"2012-01-21T03:04:25Z","abstract_excerpt":"In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction of tailbiting backward error-trellises. Moreover, we obtain the scalar parity-check matrix for a tailbiting convolutional code. The proposed construction is based on the adjoint-obvious realization of a syndrome "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4428","kind":"arxiv","version":1},"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":"1201.4428","created_at":"2026-05-18T04:04:06.114330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4428v1","created_at":"2026-05-18T04:04:06.114330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4428","created_at":"2026-05-18T04:04:06.114330+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPIN6V6FGGNZ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPIN6V6FGGNZJ42C","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPIN6V6F","created_at":"2026-05-18T12:27:06.952714+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/GPIN6V6FGGNZJ42CW7KKMSYIQL","json":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL.json","graph_json":"https://pith.science/api/pith-number/GPIN6V6FGGNZJ42CW7KKMSYIQL/graph.json","events_json":"https://pith.science/api/pith-number/GPIN6V6FGGNZJ42CW7KKMSYIQL/events.json","paper":"https://pith.science/paper/GPIN6V6F"},"agent_actions":{"view_html":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL","download_json":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL.json","view_paper":"https://pith.science/paper/GPIN6V6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4428&json=true","fetch_graph":"https://pith.science/api/pith-number/GPIN6V6FGGNZJ42CW7KKMSYIQL/graph.json","fetch_events":"https://pith.science/api/pith-number/GPIN6V6FGGNZJ42CW7KKMSYIQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL/action/storage_attestation","attest_author":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL/action/author_attestation","sign_citation":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL/action/citation_signature","submit_replication":"https://pith.science/pith/GPIN6V6FGGNZJ42CW7KKMSYIQL/action/replication_record"}},"created_at":"2026-05-18T04:04:06.114330+00:00","updated_at":"2026-05-18T04:04:06.114330+00:00"}