{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EM6V2TDJJDRW66KY3DYBBKZP64","short_pith_number":"pith:EM6V2TDJ","schema_version":"1.0","canonical_sha256":"233d5d4c6948e36f7958d8f010ab2ff7016fff59aab42a453b8b407e20eed25c","source":{"kind":"arxiv","id":"1608.00820","version":2},"attestation_state":"computed","paper":{"title":"On constacyclic codes over $\\mathbb{Z}_4[u]/\\langle u^2-1\\rangle$ and their Gray images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lin Sok, Liqing Qian, Minjia Shi, Nuh Aydin, Patrick Sol\\'e","submitted_at":"2016-08-02T13:46:08Z","abstract_excerpt":"We first define a new Gray map from $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$ to $\\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$. Considering their $\\mathbb{Z}_4$ images, we prove that the Gray images of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic codes of length $2n$ over $\\mathbb{Z}_4$. In many cases the latter codes have better parameters than those in the online database of Aydin and Asamov. We also give a corrected version of a table of new cyclic $R$-codes published by "},"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":"1608.00820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-02T13:46:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3979eb434f56d3070fa6d945b3162eb7d10739a2c417c22513703293e4ac6ace","abstract_canon_sha256":"b572045eaa6b412ce9f189bdeae610f8606dfa49badcc3b7decab607b4002f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:59.504750Z","signature_b64":"/8Ha3BM0jRAXn+zPwUvwV4Nj/oLp8phDZ0C20KKR5XKfGi/X9QVwp1yE9fR93tTUy7Ixyuf4ZzUyWE80uveICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233d5d4c6948e36f7958d8f010ab2ff7016fff59aab42a453b8b407e20eed25c","last_reissued_at":"2026-05-18T00:53:59.504160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:59.504160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On constacyclic codes over $\\mathbb{Z}_4[u]/\\langle u^2-1\\rangle$ and their Gray images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lin Sok, Liqing Qian, Minjia Shi, Nuh Aydin, Patrick Sol\\'e","submitted_at":"2016-08-02T13:46:08Z","abstract_excerpt":"We first define a new Gray map from $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$ to $\\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$. Considering their $\\mathbb{Z}_4$ images, we prove that the Gray images of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic codes of length $2n$ over $\\mathbb{Z}_4$. In many cases the latter codes have better parameters than those in the online database of Aydin and Asamov. We also give a corrected version of a table of new cyclic $R$-codes published by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00820","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":"1608.00820","created_at":"2026-05-18T00:53:59.504256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00820v2","created_at":"2026-05-18T00:53:59.504256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00820","created_at":"2026-05-18T00:53:59.504256+00:00"},{"alias_kind":"pith_short_12","alias_value":"EM6V2TDJJDRW","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EM6V2TDJJDRW66KY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EM6V2TDJ","created_at":"2026-05-18T12:30:12.583610+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/EM6V2TDJJDRW66KY3DYBBKZP64","json":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64.json","graph_json":"https://pith.science/api/pith-number/EM6V2TDJJDRW66KY3DYBBKZP64/graph.json","events_json":"https://pith.science/api/pith-number/EM6V2TDJJDRW66KY3DYBBKZP64/events.json","paper":"https://pith.science/paper/EM6V2TDJ"},"agent_actions":{"view_html":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64","download_json":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64.json","view_paper":"https://pith.science/paper/EM6V2TDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00820&json=true","fetch_graph":"https://pith.science/api/pith-number/EM6V2TDJJDRW66KY3DYBBKZP64/graph.json","fetch_events":"https://pith.science/api/pith-number/EM6V2TDJJDRW66KY3DYBBKZP64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64/action/storage_attestation","attest_author":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64/action/author_attestation","sign_citation":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64/action/citation_signature","submit_replication":"https://pith.science/pith/EM6V2TDJJDRW66KY3DYBBKZP64/action/replication_record"}},"created_at":"2026-05-18T00:53:59.504256+00:00","updated_at":"2026-05-18T00:53:59.504256+00:00"}