{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MC7KWNJQL64XDSFUZ3TJEZ27N4","short_pith_number":"pith:MC7KWNJQ","schema_version":"1.0","canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","source":{"kind":"arxiv","id":"1107.5523","version":4},"attestation_state":"computed","paper":{"title":"An Algebraic Approach for Decoding Spread Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elisa Gorla, Felice Manganiello, Joachim Rosenthal","submitted_at":"2011-07-27T16:30:53Z","abstract_excerpt":"In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic "},"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":"1107.5523","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-27T16:30:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84f95eb2347dae66e041023ef5a19dd899f881319298c5be9dbbce2eddcaf006","abstract_canon_sha256":"1f784f359a6be0e84ad0673b6863a80cc8dd83d990f0494ec42a897dd96bceb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.124535Z","signature_b64":"CxVWdjpE0miwuhtFREZ6gep4wx2iuKB9V8kuQlUr+czfbEZs/uW8WcMNykSDgEsX4iREXsjr/vIlp20lvUxmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","last_reissued_at":"2026-05-18T03:54:06.123834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.123834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algebraic Approach for Decoding Spread Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elisa Gorla, Felice Manganiello, Joachim Rosenthal","submitted_at":"2011-07-27T16:30:53Z","abstract_excerpt":"In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5523","kind":"arxiv","version":4},"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":"1107.5523","created_at":"2026-05-18T03:54:06.123946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5523v4","created_at":"2026-05-18T03:54:06.123946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5523","created_at":"2026-05-18T03:54:06.123946+00:00"},{"alias_kind":"pith_short_12","alias_value":"MC7KWNJQL64X","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MC7KWNJQL64XDSFU","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MC7KWNJQ","created_at":"2026-05-18T12:26:34.985390+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/MC7KWNJQL64XDSFUZ3TJEZ27N4","json":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4.json","graph_json":"https://pith.science/api/pith-number/MC7KWNJQL64XDSFUZ3TJEZ27N4/graph.json","events_json":"https://pith.science/api/pith-number/MC7KWNJQL64XDSFUZ3TJEZ27N4/events.json","paper":"https://pith.science/paper/MC7KWNJQ"},"agent_actions":{"view_html":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4","download_json":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4.json","view_paper":"https://pith.science/paper/MC7KWNJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5523&json=true","fetch_graph":"https://pith.science/api/pith-number/MC7KWNJQL64XDSFUZ3TJEZ27N4/graph.json","fetch_events":"https://pith.science/api/pith-number/MC7KWNJQL64XDSFUZ3TJEZ27N4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/action/storage_attestation","attest_author":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/action/author_attestation","sign_citation":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/action/citation_signature","submit_replication":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/action/replication_record"}},"created_at":"2026-05-18T03:54:06.123946+00:00","updated_at":"2026-05-18T03:54:06.123946+00:00"}