{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:D5UWNTOEXA73IWB2LKA4ANWTGG","short_pith_number":"pith:D5UWNTOE","schema_version":"1.0","canonical_sha256":"1f6966cdc4b83fb4583a5a81c036d3319a689811df8f1ccd181d4033f109e88a","source":{"kind":"arxiv","id":"1101.5966","version":1},"attestation_state":"computed","paper":{"title":"On the Analysis of Weighted Nonbinary Repeat Multiple-Accumulate Codes","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","submitted_at":"2011-01-31T13:54:30Z","abstract_excerpt":"In this paper, we consider weighted nonbinary repeat multiple-accumulate (WNRMA) code ensembles obtained from the serial concatenation of a nonbinary rate-1/n repeat code and the cascade of L>= 1 accumulators, where each encoder is followed by a nonbinary random weighter. The WNRMA codes are assumed to be iteratively decoded using the turbo principle with maximum a posteriori constituent decoders. We derive the exact weight enumerator of nonbinary accumulators and subsequently give the weight enumerators for WNRMA code ensembles. We formally prove that the symbol-wise minimum distance of WNRMA"},"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":"1101.5966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T13:54:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cee6a2be6ff7c2037b9cca0a8fa055fe3d73bd896b962e1f2192bf9d80622e52","abstract_canon_sha256":"972e7e8d402bd42f5d512f7b133b2cf77ae932d6af978982236bfcc91a3f94c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:24.506303Z","signature_b64":"UfEm6j7GBegyhD4P1AJA3HaEdyjc00GlcOTrEAxysr7cpH1s+FigtO1w4e49jSqnOuwf/cFHVI9ldqhX7MruBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6966cdc4b83fb4583a5a81c036d3319a689811df8f1ccd181d4033f109e88a","last_reissued_at":"2026-05-18T04:30:24.505697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:24.505697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Analysis of Weighted Nonbinary Repeat Multiple-Accumulate Codes","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","submitted_at":"2011-01-31T13:54:30Z","abstract_excerpt":"In this paper, we consider weighted nonbinary repeat multiple-accumulate (WNRMA) code ensembles obtained from the serial concatenation of a nonbinary rate-1/n repeat code and the cascade of L>= 1 accumulators, where each encoder is followed by a nonbinary random weighter. The WNRMA codes are assumed to be iteratively decoded using the turbo principle with maximum a posteriori constituent decoders. We derive the exact weight enumerator of nonbinary accumulators and subsequently give the weight enumerators for WNRMA code ensembles. We formally prove that the symbol-wise minimum distance of WNRMA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5966","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":"1101.5966","created_at":"2026-05-18T04:30:24.505776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5966v1","created_at":"2026-05-18T04:30:24.505776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5966","created_at":"2026-05-18T04:30:24.505776+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5UWNTOEXA73","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5UWNTOEXA73IWB2","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5UWNTOE","created_at":"2026-05-18T12:26:26.731475+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/D5UWNTOEXA73IWB2LKA4ANWTGG","json":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG.json","graph_json":"https://pith.science/api/pith-number/D5UWNTOEXA73IWB2LKA4ANWTGG/graph.json","events_json":"https://pith.science/api/pith-number/D5UWNTOEXA73IWB2LKA4ANWTGG/events.json","paper":"https://pith.science/paper/D5UWNTOE"},"agent_actions":{"view_html":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG","download_json":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG.json","view_paper":"https://pith.science/paper/D5UWNTOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5966&json=true","fetch_graph":"https://pith.science/api/pith-number/D5UWNTOEXA73IWB2LKA4ANWTGG/graph.json","fetch_events":"https://pith.science/api/pith-number/D5UWNTOEXA73IWB2LKA4ANWTGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG/action/storage_attestation","attest_author":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG/action/author_attestation","sign_citation":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG/action/citation_signature","submit_replication":"https://pith.science/pith/D5UWNTOEXA73IWB2LKA4ANWTGG/action/replication_record"}},"created_at":"2026-05-18T04:30:24.505776+00:00","updated_at":"2026-05-18T04:30:24.505776+00:00"}