{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JFO2Q6RUEXUMZ7SFBML5HDTAYH","short_pith_number":"pith:JFO2Q6RU","schema_version":"1.0","canonical_sha256":"495da87a3425e8ccfe450b17d38e60c1dd877dca0e4a7a211dbbb4e755c83b2f","source":{"kind":"arxiv","id":"1211.1728","version":2},"attestation_state":"computed","paper":{"title":"Maximum Distance Separable Codes for Symbol-Pair Read Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chengmin Wang, Han Mao Kiah, Jianxing Yin, Lijun Ji, Yeow Meng Chee","submitted_at":"2012-11-07T23:39:26Z","abstract_excerpt":"We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length \\Omega(q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters."},"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":"1211.1728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-07T23:39:26Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"b0813fc8cff68af5200ea3efab0036a6f5d98cee303c75c68f8128d373c1dc15","abstract_canon_sha256":"b60d1166fcef57c531bab8ecc597d5092879de0e9266b70c12565308590e830d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:11.817920Z","signature_b64":"zT4KsJGpLK8GhrPR534qZvFx6Zi4ZE5hJiBk7UVDfDeSSepPyI90j78zXzYxjExGoKymIrK7yhzaHC5MKAhECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"495da87a3425e8ccfe450b17d38e60c1dd877dca0e4a7a211dbbb4e755c83b2f","last_reissued_at":"2026-05-18T03:17:11.817240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:11.817240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Distance Separable Codes for Symbol-Pair Read Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chengmin Wang, Han Mao Kiah, Jianxing Yin, Lijun Ji, Yeow Meng Chee","submitted_at":"2012-11-07T23:39:26Z","abstract_excerpt":"We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length \\Omega(q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1728","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":"1211.1728","created_at":"2026-05-18T03:17:11.817341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1728v2","created_at":"2026-05-18T03:17:11.817341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1728","created_at":"2026-05-18T03:17:11.817341+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFO2Q6RUEXUM","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFO2Q6RUEXUMZ7SF","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFO2Q6RU","created_at":"2026-05-18T12:27:11.947152+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/JFO2Q6RUEXUMZ7SFBML5HDTAYH","json":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH.json","graph_json":"https://pith.science/api/pith-number/JFO2Q6RUEXUMZ7SFBML5HDTAYH/graph.json","events_json":"https://pith.science/api/pith-number/JFO2Q6RUEXUMZ7SFBML5HDTAYH/events.json","paper":"https://pith.science/paper/JFO2Q6RU"},"agent_actions":{"view_html":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH","download_json":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH.json","view_paper":"https://pith.science/paper/JFO2Q6RU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1728&json=true","fetch_graph":"https://pith.science/api/pith-number/JFO2Q6RUEXUMZ7SFBML5HDTAYH/graph.json","fetch_events":"https://pith.science/api/pith-number/JFO2Q6RUEXUMZ7SFBML5HDTAYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH/action/storage_attestation","attest_author":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH/action/author_attestation","sign_citation":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH/action/citation_signature","submit_replication":"https://pith.science/pith/JFO2Q6RUEXUMZ7SFBML5HDTAYH/action/replication_record"}},"created_at":"2026-05-18T03:17:11.817341+00:00","updated_at":"2026-05-18T03:17:11.817341+00:00"}