{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4HUNL26PEF5BRLPY42OLR723KQ","short_pith_number":"pith:4HUNL26P","schema_version":"1.0","canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","source":{"kind":"arxiv","id":"1408.2303","version":3},"attestation_state":"computed","paper":{"title":"Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Margreta Kuijper","submitted_at":"2014-08-11T04:25:52Z","abstract_excerpt":"We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm computes a list of message words that correspond to all closest codewords to a given received word. This involves the computation of a minimal basis for the interpolation module that corresponds to the received word, followed by a search through the parametrization for valid message words. Our module-theoretic approach strengthens the link between Gabidulin decoding and Reed-Solomon decoding. Two subalgorithms are present"},"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":"1408.2303","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T04:25:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3cd5a3e648f11a844eb040aa0763d238cabba8dee5e09fd29fbaa8128c2fe40","abstract_canon_sha256":"2f74bba4b6ca011845452051153f1886ef13521555a14bbe4043f66e6319c59d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:25.640524Z","signature_b64":"z2HJinKWWQQgqA/cvCsOvSw3xUUqGPA0oa354Su4b/H9ru7TMIOWEf+9uhST9Tyf/EZL0Xxn13sXFo3mW1quBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","last_reissued_at":"2026-05-18T01:34:25.640103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:25.640103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Margreta Kuijper","submitted_at":"2014-08-11T04:25:52Z","abstract_excerpt":"We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm computes a list of message words that correspond to all closest codewords to a given received word. This involves the computation of a minimal basis for the interpolation module that corresponds to the received word, followed by a search through the parametrization for valid message words. Our module-theoretic approach strengthens the link between Gabidulin decoding and Reed-Solomon decoding. Two subalgorithms are present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2303","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":"1408.2303","created_at":"2026-05-18T01:34:25.640173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2303v3","created_at":"2026-05-18T01:34:25.640173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2303","created_at":"2026-05-18T01:34:25.640173+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HUNL26PEF5B","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HUNL26PEF5BRLPY","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HUNL26P","created_at":"2026-05-18T12:28:14.216126+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/4HUNL26PEF5BRLPY42OLR723KQ","json":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ.json","graph_json":"https://pith.science/api/pith-number/4HUNL26PEF5BRLPY42OLR723KQ/graph.json","events_json":"https://pith.science/api/pith-number/4HUNL26PEF5BRLPY42OLR723KQ/events.json","paper":"https://pith.science/paper/4HUNL26P"},"agent_actions":{"view_html":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ","download_json":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ.json","view_paper":"https://pith.science/paper/4HUNL26P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2303&json=true","fetch_graph":"https://pith.science/api/pith-number/4HUNL26PEF5BRLPY42OLR723KQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4HUNL26PEF5BRLPY42OLR723KQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/action/storage_attestation","attest_author":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/action/author_attestation","sign_citation":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/action/citation_signature","submit_replication":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/action/replication_record"}},"created_at":"2026-05-18T01:34:25.640173+00:00","updated_at":"2026-05-18T01:34:25.640173+00:00"}