{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3MMF5NO5TDII5PMEEAPT77TZXN","short_pith_number":"pith:3MMF5NO5","schema_version":"1.0","canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","source":{"kind":"arxiv","id":"1712.07783","version":1},"attestation_state":"computed","paper":{"title":"Skew cyclic codes over $\\mathbb{F}_{p}+u\\mathbb{F}_{p}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Javad Haghighat, Nuh Aydin, Reza Dastbasteh, Seyyed Hamed Mousavi, Taher Abualrub","submitted_at":"2017-12-21T03:44:58Z","abstract_excerpt":"In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\\mathbb{F}_{p}+u\\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\\theta ]$-submodules of $R_{n}=R[x;\\theta ]/\\langle x^{n}-1\\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding and decoding algorithm is presented for skew cyclic codes over the ring $R$. Finally, based on the theory we developed in this paper, we provide examples of codes with good parameters over $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":"1712.07783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T03:44:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"86461b25abc6f737ae6f63f242c498f09263d700b1fba8e463946927e674e528","abstract_canon_sha256":"e374689409a4b2291bfe27614c85ca618999ea0eba9756bb419932f58dc300bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:30.880656Z","signature_b64":"dmmfWTp/LTSN/UnMUDRT+QUc6ApqyXi1YBdxi1mHczMrW5T1a6amOqke9pG9TJnFL6dNiz4htdYVCvj4ycrcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","last_reissued_at":"2026-05-18T00:27:30.879934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:30.879934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skew cyclic codes over $\\mathbb{F}_{p}+u\\mathbb{F}_{p}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Javad Haghighat, Nuh Aydin, Reza Dastbasteh, Seyyed Hamed Mousavi, Taher Abualrub","submitted_at":"2017-12-21T03:44:58Z","abstract_excerpt":"In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\\mathbb{F}_{p}+u\\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\\theta ]$-submodules of $R_{n}=R[x;\\theta ]/\\langle x^{n}-1\\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding and decoding algorithm is presented for skew cyclic codes over the ring $R$. Finally, based on the theory we developed in this paper, we provide examples of codes with good parameters over $F_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07783","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":"1712.07783","created_at":"2026-05-18T00:27:30.880053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07783v1","created_at":"2026-05-18T00:27:30.880053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07783","created_at":"2026-05-18T00:27:30.880053+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MMF5NO5TDII","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MMF5NO5TDII5PME","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MMF5NO5","created_at":"2026-05-18T12:30:58.224056+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/3MMF5NO5TDII5PMEEAPT77TZXN","json":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN.json","graph_json":"https://pith.science/api/pith-number/3MMF5NO5TDII5PMEEAPT77TZXN/graph.json","events_json":"https://pith.science/api/pith-number/3MMF5NO5TDII5PMEEAPT77TZXN/events.json","paper":"https://pith.science/paper/3MMF5NO5"},"agent_actions":{"view_html":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN","download_json":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN.json","view_paper":"https://pith.science/paper/3MMF5NO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07783&json=true","fetch_graph":"https://pith.science/api/pith-number/3MMF5NO5TDII5PMEEAPT77TZXN/graph.json","fetch_events":"https://pith.science/api/pith-number/3MMF5NO5TDII5PMEEAPT77TZXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/action/storage_attestation","attest_author":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/action/author_attestation","sign_citation":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/action/citation_signature","submit_replication":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/action/replication_record"}},"created_at":"2026-05-18T00:27:30.880053+00:00","updated_at":"2026-05-18T00:27:30.880053+00:00"}