{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GTMJGGIXELSNTOOZYOWD7NLNVU","short_pith_number":"pith:GTMJGGIX","schema_version":"1.0","canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","source":{"kind":"arxiv","id":"1512.01839","version":2},"attestation_state":"computed","paper":{"title":"Partial permutation decoding for binary linear and Z4-linear Hadamard codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Merc\\`e Villanueva, Roland D. Barrolleta","submitted_at":"2015-12-06T21:43:56Z","abstract_excerpt":"Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor$-PD-sets of minimum size $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor + 1$ for partial permutation decoding for binary linear Hadamard codes $H_m$ of length $2^m$, for all $m\\geq 4$, is described. Moreover, a recursive construction to obtain $s$-PD-sets of size $l$ for $H_{m+1}$ of length $2^{m+1}$, from a given $s$-PD-set of the same size f"},"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":"1512.01839","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T21:43:56Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"41c4b10478bb2e3e90c8f589c55aa1eae1a6d4a57dc7d3cf6d3450440d21191f","abstract_canon_sha256":"144580d4c475da4aaa4bfb530a21253aa5979b24f7d4a637753b60a61f528e9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:57.830049Z","signature_b64":"Kbw/WQFTKoUw1p27+CRGEBOMFaXo1ohqcga0ihwFGJaOhAfcgUwHbIVtLULOHfpkGOZvl4nxoz3baP3mVW9SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","last_reissued_at":"2026-05-18T01:15:57.829344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:57.829344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial permutation decoding for binary linear and Z4-linear Hadamard codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Merc\\`e Villanueva, Roland D. Barrolleta","submitted_at":"2015-12-06T21:43:56Z","abstract_excerpt":"Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor$-PD-sets of minimum size $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor + 1$ for partial permutation decoding for binary linear Hadamard codes $H_m$ of length $2^m$, for all $m\\geq 4$, is described. Moreover, a recursive construction to obtain $s$-PD-sets of size $l$ for $H_{m+1}$ of length $2^{m+1}$, from a given $s$-PD-set of the same size f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01839","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":"1512.01839","created_at":"2026-05-18T01:15:57.829473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01839v2","created_at":"2026-05-18T01:15:57.829473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01839","created_at":"2026-05-18T01:15:57.829473+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTMJGGIXELSN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTMJGGIXELSNTOOZ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTMJGGIX","created_at":"2026-05-18T12:29:22.688609+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/GTMJGGIXELSNTOOZYOWD7NLNVU","json":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU.json","graph_json":"https://pith.science/api/pith-number/GTMJGGIXELSNTOOZYOWD7NLNVU/graph.json","events_json":"https://pith.science/api/pith-number/GTMJGGIXELSNTOOZYOWD7NLNVU/events.json","paper":"https://pith.science/paper/GTMJGGIX"},"agent_actions":{"view_html":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU","download_json":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU.json","view_paper":"https://pith.science/paper/GTMJGGIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01839&json=true","fetch_graph":"https://pith.science/api/pith-number/GTMJGGIXELSNTOOZYOWD7NLNVU/graph.json","fetch_events":"https://pith.science/api/pith-number/GTMJGGIXELSNTOOZYOWD7NLNVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/action/storage_attestation","attest_author":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/action/author_attestation","sign_citation":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/action/citation_signature","submit_replication":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/action/replication_record"}},"created_at":"2026-05-18T01:15:57.829473+00:00","updated_at":"2026-05-18T01:15:57.829473+00:00"}