{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YNCHTITQZ5KKQPQCLGAV63CZ4Y","short_pith_number":"pith:YNCHTITQ","schema_version":"1.0","canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","source":{"kind":"arxiv","id":"1705.10091","version":1},"attestation_state":"computed","paper":{"title":"Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"\\'Angela Barbero, {\\O}yvind Ytrehus","submitted_at":"2017-05-29T09:41:36Z","abstract_excerpt":"A systematic convolutional encoder of rate $(n-1)/n$ and maximum degree $D$ generates a code of free distance at most ${\\cal D} = D+2$ and, at best, a column distance profile (CDP) of $[2,3,\\ldots,{\\cal D}]$. A code is \\emph{Maximum Distance Separable} (MDS) if it possesses this CDP. Applied on a communication channel over which packets are transmitted sequentially and which loses (erases) packets randomly, such a code allows the recovery from any pattern of $j$ erasures in the first $j$ $n$-packet blocks for $j<{\\cal D}$, with a delay of at most $j$ blocks counting from the first erasure. Thi"},"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":"1705.10091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-29T09:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a847690b2d737b1339708cae57cc5604d447cce54da252c1668911098dab2aaa","abstract_canon_sha256":"ad804721f77d26354b9ed455be78d15268df7930a0a004addbaae2e691999762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.977761Z","signature_b64":"7Ix6wiaj5eLSQYnT6DpH1dcV4DP1e/A787OxGoSMnt/XGWl9MwZqmk2S/KPhm0aYwyXIdgfK+lF1Fuz7A8GACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34479a270cf54a83e0259815f6c59e62ef4fd3468e4cff502e446bb3848cbeb","last_reissued_at":"2026-05-18T00:43:31.977110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.977110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"\\'Angela Barbero, {\\O}yvind Ytrehus","submitted_at":"2017-05-29T09:41:36Z","abstract_excerpt":"A systematic convolutional encoder of rate $(n-1)/n$ and maximum degree $D$ generates a code of free distance at most ${\\cal D} = D+2$ and, at best, a column distance profile (CDP) of $[2,3,\\ldots,{\\cal D}]$. A code is \\emph{Maximum Distance Separable} (MDS) if it possesses this CDP. Applied on a communication channel over which packets are transmitted sequentially and which loses (erases) packets randomly, such a code allows the recovery from any pattern of $j$ erasures in the first $j$ $n$-packet blocks for $j<{\\cal D}$, with a delay of at most $j$ blocks counting from the first erasure. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10091","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":"1705.10091","created_at":"2026-05-18T00:43:31.977188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10091v1","created_at":"2026-05-18T00:43:31.977188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10091","created_at":"2026-05-18T00:43:31.977188+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNCHTITQZ5KK","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNCHTITQZ5KKQPQC","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNCHTITQ","created_at":"2026-05-18T12:31:56.362134+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/YNCHTITQZ5KKQPQCLGAV63CZ4Y","json":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y.json","graph_json":"https://pith.science/api/pith-number/YNCHTITQZ5KKQPQCLGAV63CZ4Y/graph.json","events_json":"https://pith.science/api/pith-number/YNCHTITQZ5KKQPQCLGAV63CZ4Y/events.json","paper":"https://pith.science/paper/YNCHTITQ"},"agent_actions":{"view_html":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y","download_json":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y.json","view_paper":"https://pith.science/paper/YNCHTITQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10091&json=true","fetch_graph":"https://pith.science/api/pith-number/YNCHTITQZ5KKQPQCLGAV63CZ4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/YNCHTITQZ5KKQPQCLGAV63CZ4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/action/storage_attestation","attest_author":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/action/author_attestation","sign_citation":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/action/citation_signature","submit_replication":"https://pith.science/pith/YNCHTITQZ5KKQPQCLGAV63CZ4Y/action/replication_record"}},"created_at":"2026-05-18T00:43:31.977188+00:00","updated_at":"2026-05-18T00:43:31.977188+00:00"}