{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DYCLOLG3TTLPOIYO7JSEXAQDMF","short_pith_number":"pith:DYCLOLG3","schema_version":"1.0","canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","source":{"kind":"arxiv","id":"1907.07111","version":1},"attestation_state":"computed","paper":{"title":"Construction and enumeration for self-dual cyclic codes of even length over $\\mathbb{F}_{2^m} + u\\mathbb{F}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanghui Ma, Fang-Wei Fu, Hai Q. Dinh, Yonglin Cao, Yuan Cao","submitted_at":"2019-07-14T13:43:24Z","abstract_excerpt":"Let $\\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\\mathbb{F}_{2^m}+u\\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual cyclic code over the finite chain ring $R$ of length $2^sn$ and provide a calculation method to obtain all distinct codes. Moreover, we obtain a clear formula to count the number of all these self-dual cyclic codes. As an application, self-dual and $2$-quasi-cyclic codes over $\\mathbb{F}_{2^m}$ of length $2^{s+1}n$ can be obtained from self-dual cyclic code over "},"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":"1907.07111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-14T13:43:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5431bd8ee8c021e0f1b4b1b62a4271d63cc5c00a0631fcfef502421a7ef9e03d","abstract_canon_sha256":"f000e057232a6c88192ccf162ddeadb388d047af4af196ecf2d783dfd7f01ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:28.048882Z","signature_b64":"2Grv9d+wPwtel2kvuKcwVVtOcf0xxQvJH/CjJGo7cH1qbwyJJKHKjip1KNGzRCAwvCAZI19Yrp2T8h/PfQ4eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","last_reissued_at":"2026-05-17T23:40:28.048255Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:28.048255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction and enumeration for self-dual cyclic codes of even length over $\\mathbb{F}_{2^m} + u\\mathbb{F}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanghui Ma, Fang-Wei Fu, Hai Q. Dinh, Yonglin Cao, Yuan Cao","submitted_at":"2019-07-14T13:43:24Z","abstract_excerpt":"Let $\\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\\mathbb{F}_{2^m}+u\\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual cyclic code over the finite chain ring $R$ of length $2^sn$ and provide a calculation method to obtain all distinct codes. Moreover, we obtain a clear formula to count the number of all these self-dual cyclic codes. As an application, self-dual and $2$-quasi-cyclic codes over $\\mathbb{F}_{2^m}$ of length $2^{s+1}n$ can be obtained from self-dual cyclic code over "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07111","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":"1907.07111","created_at":"2026-05-17T23:40:28.048350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07111v1","created_at":"2026-05-17T23:40:28.048350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07111","created_at":"2026-05-17T23:40:28.048350+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYCLOLG3TTLP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYCLOLG3TTLPOIYO","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYCLOLG3","created_at":"2026-05-18T12:33:15.570797+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/DYCLOLG3TTLPOIYO7JSEXAQDMF","json":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF.json","graph_json":"https://pith.science/api/pith-number/DYCLOLG3TTLPOIYO7JSEXAQDMF/graph.json","events_json":"https://pith.science/api/pith-number/DYCLOLG3TTLPOIYO7JSEXAQDMF/events.json","paper":"https://pith.science/paper/DYCLOLG3"},"agent_actions":{"view_html":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF","download_json":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF.json","view_paper":"https://pith.science/paper/DYCLOLG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07111&json=true","fetch_graph":"https://pith.science/api/pith-number/DYCLOLG3TTLPOIYO7JSEXAQDMF/graph.json","fetch_events":"https://pith.science/api/pith-number/DYCLOLG3TTLPOIYO7JSEXAQDMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/action/storage_attestation","attest_author":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/action/author_attestation","sign_citation":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/action/citation_signature","submit_replication":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/action/replication_record"}},"created_at":"2026-05-17T23:40:28.048350+00:00","updated_at":"2026-05-17T23:40:28.048350+00:00"}