{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R62GHSIE3KCN4UQG2ERZAVKVBP","short_pith_number":"pith:R62GHSIE","schema_version":"1.0","canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","source":{"kind":"arxiv","id":"1701.01044","version":1},"attestation_state":"computed","paper":{"title":"A Generalization of Quasi-twisted Codes: Multi-twisted codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajdin Halilovic, Nuh Aydin","submitted_at":"2017-01-04T15:16:49Z","abstract_excerpt":"Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. Th"},"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":"1701.01044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T15:16:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"034a422cebe8cbc9192ff3a5343d82eaf1786180ae4cc513d98fdff60aa2dc7c","abstract_canon_sha256":"e22e2f10c9ea128850e15b45ee4fc940f043f134c48a24af15abcefdb28f420a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.607151Z","signature_b64":"3rqq/JewDDStlFe3B/JwJBztVaqvUuZKj4EVNAFV3cGusjICaO6l3q3bslh7y2xeuhormz5mXGEV6D4tMpJ0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","last_reissued_at":"2026-05-18T00:53:21.606746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.606746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalization of Quasi-twisted Codes: Multi-twisted codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajdin Halilovic, Nuh Aydin","submitted_at":"2017-01-04T15:16:49Z","abstract_excerpt":"Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01044","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":"1701.01044","created_at":"2026-05-18T00:53:21.606812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01044v1","created_at":"2026-05-18T00:53:21.606812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01044","created_at":"2026-05-18T00:53:21.606812+00:00"},{"alias_kind":"pith_short_12","alias_value":"R62GHSIE3KCN","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R62GHSIE3KCN4UQG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R62GHSIE","created_at":"2026-05-18T12:31:39.905425+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/R62GHSIE3KCN4UQG2ERZAVKVBP","json":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP.json","graph_json":"https://pith.science/api/pith-number/R62GHSIE3KCN4UQG2ERZAVKVBP/graph.json","events_json":"https://pith.science/api/pith-number/R62GHSIE3KCN4UQG2ERZAVKVBP/events.json","paper":"https://pith.science/paper/R62GHSIE"},"agent_actions":{"view_html":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP","download_json":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP.json","view_paper":"https://pith.science/paper/R62GHSIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01044&json=true","fetch_graph":"https://pith.science/api/pith-number/R62GHSIE3KCN4UQG2ERZAVKVBP/graph.json","fetch_events":"https://pith.science/api/pith-number/R62GHSIE3KCN4UQG2ERZAVKVBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/action/storage_attestation","attest_author":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/action/author_attestation","sign_citation":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/action/citation_signature","submit_replication":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/action/replication_record"}},"created_at":"2026-05-18T00:53:21.606812+00:00","updated_at":"2026-05-18T00:53:21.606812+00:00"}