{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:33JIIWOIDTK3NKZDYKESBG5MIM","short_pith_number":"pith:33JIIWOI","schema_version":"1.0","canonical_sha256":"ded28459c81cd5b6ab23c289209bac430265c3b9a49831f3f1d803e9364c69b2","source":{"kind":"arxiv","id":"1512.06690","version":1},"attestation_state":"computed","paper":{"title":"Spectral Analysis of Quasi-Cyclic Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, San Ling","submitted_at":"2015-12-21T16:44:32Z","abstract_excerpt":"This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the row- and the column-code. Moreover, we provide a new lower bound on the minimum Hamming distance of a given quasi-cyclic code and present a new algebraic decoding algorithm.More specifically, we prove an explicit (unreduced) basis of an l\\_a l\\_b-quasi-cyclic product code in terms of the generator matrix in reduced Gr{\\\"o}bner basis with respect to the positio"},"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.06690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T16:44:32Z","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.NT"],"title_canon_sha256":"719f6846649c5c23db3d082bf3fe0d4db772669a609691866e027fa67c26cf1e","abstract_canon_sha256":"611ea77d9012b9d8dbb7be0f01dc411e84654c146d43b2f8b6c02b34dc9856b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:59.905915Z","signature_b64":"+QqDblkxtJxatKFVzATtPhx2gNo2byDuWrk6mHHEGAJucxmW0Dpf5/J7hPRQJrln4FR0EihfaqY000rZnon5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded28459c81cd5b6ab23c289209bac430265c3b9a49831f3f1d803e9364c69b2","last_reissued_at":"2026-05-18T01:23:59.905195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:59.905195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Analysis of Quasi-Cyclic Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, San Ling","submitted_at":"2015-12-21T16:44:32Z","abstract_excerpt":"This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the row- and the column-code. Moreover, we provide a new lower bound on the minimum Hamming distance of a given quasi-cyclic code and present a new algebraic decoding algorithm.More specifically, we prove an explicit (unreduced) basis of an l\\_a l\\_b-quasi-cyclic product code in terms of the generator matrix in reduced Gr{\\\"o}bner basis with respect to the positio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06690","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":"1512.06690","created_at":"2026-05-18T01:23:59.905321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06690v1","created_at":"2026-05-18T01:23:59.905321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06690","created_at":"2026-05-18T01:23:59.905321+00:00"},{"alias_kind":"pith_short_12","alias_value":"33JIIWOIDTK3","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"33JIIWOIDTK3NKZD","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"33JIIWOI","created_at":"2026-05-18T12:29:02.477457+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/33JIIWOIDTK3NKZDYKESBG5MIM","json":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM.json","graph_json":"https://pith.science/api/pith-number/33JIIWOIDTK3NKZDYKESBG5MIM/graph.json","events_json":"https://pith.science/api/pith-number/33JIIWOIDTK3NKZDYKESBG5MIM/events.json","paper":"https://pith.science/paper/33JIIWOI"},"agent_actions":{"view_html":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM","download_json":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM.json","view_paper":"https://pith.science/paper/33JIIWOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06690&json=true","fetch_graph":"https://pith.science/api/pith-number/33JIIWOIDTK3NKZDYKESBG5MIM/graph.json","fetch_events":"https://pith.science/api/pith-number/33JIIWOIDTK3NKZDYKESBG5MIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM/action/storage_attestation","attest_author":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM/action/author_attestation","sign_citation":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM/action/citation_signature","submit_replication":"https://pith.science/pith/33JIIWOIDTK3NKZDYKESBG5MIM/action/replication_record"}},"created_at":"2026-05-18T01:23:59.905321+00:00","updated_at":"2026-05-18T01:23:59.905321+00:00"}