{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:G5MMTORCOWPSSS7IACUBTQK5NI","short_pith_number":"pith:G5MMTORC","schema_version":"1.0","canonical_sha256":"3758c9ba22759f294be800a819c15d6a04b603328ebea085de29c6d7ca20c5c5","source":{"kind":"arxiv","id":"0911.1072","version":1},"attestation_state":"computed","paper":{"title":"Error Correcting Coding for a Non-symmetric Ternary Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Nicolas Bitouze","submitted_at":"2009-11-05T16:15:29Z","abstract_excerpt":"Ternary channels can be used to model the behavior of some memory devices, where information is stored in three different levels. In this paper, error correcting coding for a ternary channel where some of the error transitions are not allowed, is considered. The resulting channel is non-symmetric, therefore classical linear codes are not optimal for this channel. We define the maximum-likelihood (ML) decoding rule for ternary codes over this channel and show that it is complex to compute, since it depends on the channel error probability. A simpler alternative decoding rule which depends only "},"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":"0911.1072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-05T16:15:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87242bb9d4188f883e88b2f8d86e73691ff4d1db5e6761050eb80b70db7699f2","abstract_canon_sha256":"340c3b02dd6b856d5599ae90a92a28b8900a991909b44095296b32020f33aa1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:10.981944Z","signature_b64":"n/idWtQD+4Yp/Z1IlEdhqpMYLyfmdwY492SxCx1x3d9Vsp2TJ38Jv+jC1vuCnxFI2wEwBeYJlhFzwEVSbR4/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3758c9ba22759f294be800a819c15d6a04b603328ebea085de29c6d7ca20c5c5","last_reissued_at":"2026-05-18T04:21:10.981330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:10.981330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Correcting Coding for a Non-symmetric Ternary Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Nicolas Bitouze","submitted_at":"2009-11-05T16:15:29Z","abstract_excerpt":"Ternary channels can be used to model the behavior of some memory devices, where information is stored in three different levels. In this paper, error correcting coding for a ternary channel where some of the error transitions are not allowed, is considered. The resulting channel is non-symmetric, therefore classical linear codes are not optimal for this channel. We define the maximum-likelihood (ML) decoding rule for ternary codes over this channel and show that it is complex to compute, since it depends on the channel error probability. A simpler alternative decoding rule which depends only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1072","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":"0911.1072","created_at":"2026-05-18T04:21:10.981414+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.1072v1","created_at":"2026-05-18T04:21:10.981414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1072","created_at":"2026-05-18T04:21:10.981414+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5MMTORCOWPS","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5MMTORCOWPSSS7I","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5MMTORC","created_at":"2026-05-18T12:25:59.703012+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/G5MMTORCOWPSSS7IACUBTQK5NI","json":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI.json","graph_json":"https://pith.science/api/pith-number/G5MMTORCOWPSSS7IACUBTQK5NI/graph.json","events_json":"https://pith.science/api/pith-number/G5MMTORCOWPSSS7IACUBTQK5NI/events.json","paper":"https://pith.science/paper/G5MMTORC"},"agent_actions":{"view_html":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI","download_json":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI.json","view_paper":"https://pith.science/paper/G5MMTORC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.1072&json=true","fetch_graph":"https://pith.science/api/pith-number/G5MMTORCOWPSSS7IACUBTQK5NI/graph.json","fetch_events":"https://pith.science/api/pith-number/G5MMTORCOWPSSS7IACUBTQK5NI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI/action/storage_attestation","attest_author":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI/action/author_attestation","sign_citation":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI/action/citation_signature","submit_replication":"https://pith.science/pith/G5MMTORCOWPSSS7IACUBTQK5NI/action/replication_record"}},"created_at":"2026-05-18T04:21:10.981414+00:00","updated_at":"2026-05-18T04:21:10.981414+00:00"}