{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IPHZZ5YZWR55PIKF56NPRQLGS7","short_pith_number":"pith:IPHZZ5YZ","schema_version":"1.0","canonical_sha256":"43cf9cf719b47bd7a145ef9af8c16697ddbc6d0110b9c20a182494762b6f396f","source":{"kind":"arxiv","id":"1107.1529","version":2},"attestation_state":"computed","paper":{"title":"Decoding of Matrix-Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Ruano, Fernando Hernando","submitted_at":"2011-07-07T21:49:55Z","abstract_excerpt":"We propose a decoding algorithm for the $(u\\mid u+v)$-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code."},"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.1529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-07T21:49:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"121cb2243cb05ed4dc6fc8bc30648748a99ace2185fcc977fdb710eb7d1245ec","abstract_canon_sha256":"693291c346bea7e08086f29f576bc7335532156fbe72a04c7814fd98f5e097dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.723933Z","signature_b64":"wZiihwpm5iSfsWX2hEdLcKzW/8ZhpzUgQ4GYXIu4rgtI7CyuTUNcPfMgHn2kopuiJ8msoHIggSG1bTw+pU0YDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43cf9cf719b47bd7a145ef9af8c16697ddbc6d0110b9c20a182494762b6f396f","last_reissued_at":"2026-05-18T03:28:17.723281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.723281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding of Matrix-Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Ruano, Fernando Hernando","submitted_at":"2011-07-07T21:49:55Z","abstract_excerpt":"We propose a decoding algorithm for the $(u\\mid u+v)$-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1529","kind":"arxiv","version":2},"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.1529","created_at":"2026-05-18T03:28:17.723396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1529v2","created_at":"2026-05-18T03:28:17.723396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1529","created_at":"2026-05-18T03:28:17.723396+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPHZZ5YZWR55","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPHZZ5YZWR55PIKF","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPHZZ5YZ","created_at":"2026-05-18T12:26:32.869790+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/IPHZZ5YZWR55PIKF56NPRQLGS7","json":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7.json","graph_json":"https://pith.science/api/pith-number/IPHZZ5YZWR55PIKF56NPRQLGS7/graph.json","events_json":"https://pith.science/api/pith-number/IPHZZ5YZWR55PIKF56NPRQLGS7/events.json","paper":"https://pith.science/paper/IPHZZ5YZ"},"agent_actions":{"view_html":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7","download_json":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7.json","view_paper":"https://pith.science/paper/IPHZZ5YZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1529&json=true","fetch_graph":"https://pith.science/api/pith-number/IPHZZ5YZWR55PIKF56NPRQLGS7/graph.json","fetch_events":"https://pith.science/api/pith-number/IPHZZ5YZWR55PIKF56NPRQLGS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7/action/storage_attestation","attest_author":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7/action/author_attestation","sign_citation":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7/action/citation_signature","submit_replication":"https://pith.science/pith/IPHZZ5YZWR55PIKF56NPRQLGS7/action/replication_record"}},"created_at":"2026-05-18T03:28:17.723396+00:00","updated_at":"2026-05-18T03:28:17.723396+00:00"}