{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5CPWLQS26Q3GX2LHCF3SWBBPKJ","short_pith_number":"pith:5CPWLQS2","schema_version":"1.0","canonical_sha256":"e89f65c25af4366be96711772b042f527b6d98edb76080b212fc41d18e91c4f8","source":{"kind":"arxiv","id":"1301.3220","version":1},"attestation_state":"computed","paper":{"title":"A Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Li Tang, Qin Huang, Shanbao He, Zixiang Xiong, Zulin Wang","submitted_at":"2013-01-15T04:18:52Z","abstract_excerpt":"The encoding complexity of a general (en,ek) quasi-cyclic code is O[(e^2)(n-k)k]. This paper presents a novel low-complexity encoding algorithm for quasi-cyclic (QC) codes based on matrix transformation. First, a message vector is encoded into a transformed codeword in the transform domain. Then, the transmitted codeword is obtained from the transformed codeword by the inverse Galois Fourier transform. For binary QC codes, a simple and fast mapping is required to post-process the transformed codeword such that the transmitted codeword is binary as well. The complexity of our proposed encoding "},"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":"1301.3220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-15T04:18:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4cf8f9b8f529895b28936bd90e636bdd6cd2bff21f080eb4f86541c885e7de7e","abstract_canon_sha256":"1b923056259d56fa47afaedda31783e145bffd887bcfb930e822c65742b2d8fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:26.189538Z","signature_b64":"mp8sWdYJA9flwLWU4Z7i8ziJrWiOycdCC3WTCXIjUB5+qmQsNJvHjQV1kexq4RoiopVstR8Xnm7fyteKC6o5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89f65c25af4366be96711772b042f527b6d98edb76080b212fc41d18e91c4f8","last_reissued_at":"2026-05-18T03:36:26.188868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:26.188868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Li Tang, Qin Huang, Shanbao He, Zixiang Xiong, Zulin Wang","submitted_at":"2013-01-15T04:18:52Z","abstract_excerpt":"The encoding complexity of a general (en,ek) quasi-cyclic code is O[(e^2)(n-k)k]. This paper presents a novel low-complexity encoding algorithm for quasi-cyclic (QC) codes based on matrix transformation. First, a message vector is encoded into a transformed codeword in the transform domain. Then, the transmitted codeword is obtained from the transformed codeword by the inverse Galois Fourier transform. For binary QC codes, a simple and fast mapping is required to post-process the transformed codeword such that the transmitted codeword is binary as well. The complexity of our proposed encoding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3220","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":"1301.3220","created_at":"2026-05-18T03:36:26.188970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3220v1","created_at":"2026-05-18T03:36:26.188970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3220","created_at":"2026-05-18T03:36:26.188970+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CPWLQS26Q3G","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CPWLQS26Q3GX2LH","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CPWLQS2","created_at":"2026-05-18T12:27:34.582898+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/5CPWLQS26Q3GX2LHCF3SWBBPKJ","json":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ.json","graph_json":"https://pith.science/api/pith-number/5CPWLQS26Q3GX2LHCF3SWBBPKJ/graph.json","events_json":"https://pith.science/api/pith-number/5CPWLQS26Q3GX2LHCF3SWBBPKJ/events.json","paper":"https://pith.science/paper/5CPWLQS2"},"agent_actions":{"view_html":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ","download_json":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ.json","view_paper":"https://pith.science/paper/5CPWLQS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3220&json=true","fetch_graph":"https://pith.science/api/pith-number/5CPWLQS26Q3GX2LHCF3SWBBPKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5CPWLQS26Q3GX2LHCF3SWBBPKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ/action/storage_attestation","attest_author":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ/action/author_attestation","sign_citation":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ/action/citation_signature","submit_replication":"https://pith.science/pith/5CPWLQS26Q3GX2LHCF3SWBBPKJ/action/replication_record"}},"created_at":"2026-05-18T03:36:26.188970+00:00","updated_at":"2026-05-18T03:36:26.188970+00:00"}