{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:22QMWVZ6BA2T6CQV5LSOINJR3P","short_pith_number":"pith:22QMWVZ6","schema_version":"1.0","canonical_sha256":"d6a0cb573e08353f0a15eae4e43531dbe0e144a172b3e4beeafef87e4a37e9a1","source":{"kind":"arxiv","id":"2507.10068","version":1},"attestation_state":"computed","paper":{"title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anirudh Dash, K. R. Nandakishore, Lakshmi Prasad Natarajan, Prasad Krishnan","submitted_at":"2025-07-14T08:52:58Z","abstract_excerpt":"We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length $3^m$ that can be constructed using Kronecker products of a $3 \\times 3$ kernel matrix. BiD codes offer minimum distance close to that of Reed-Muller (RM) codes at practical blocklengths, and larger distance than RM codes asymptotically in the blocklength. Simulations of BiD codes of length $3^5=243$ in the erasure and Gaussian channels show that their block error rates under maximum-likelihood decoding are similar to, and sometimes better, than RM, RM-Polar, and CRC-aided Polar codes."},"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":"2507.10068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-14T08:52:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59f0cbf10a4add302eda2c6313e7c5d249460a7f2557704cc37f80aa5631cc78","abstract_canon_sha256":"5257504fe05bc93a98b07df000833c7f508881edb78d463d529286593e2e32ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:44.496681Z","signature_b64":"0xzSOgsRLj8VwqTa7gL7/NsD9DaiAqfOoJzR3vepN+/M6JNFb2PNu8+5JW2uXF1tTU1EsssINPnrzMgmBeyyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a0cb573e08353f0a15eae4e43531dbe0e144a172b3e4beeafef87e4a37e9a1","last_reissued_at":"2026-07-05T11:36:44.496217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:44.496217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BiD Codes: Algebraic Codes from $3 \\times 3$ Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anirudh Dash, K. R. Nandakishore, Lakshmi Prasad Natarajan, Prasad Krishnan","submitted_at":"2025-07-14T08:52:58Z","abstract_excerpt":"We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length $3^m$ that can be constructed using Kronecker products of a $3 \\times 3$ kernel matrix. BiD codes offer minimum distance close to that of Reed-Muller (RM) codes at practical blocklengths, and larger distance than RM codes asymptotically in the blocklength. Simulations of BiD codes of length $3^5=243$ in the erasure and Gaussian channels show that their block error rates under maximum-likelihood decoding are similar to, and sometimes better, than RM, RM-Polar, and CRC-aided Polar codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10068","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.10068/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.10068","created_at":"2026-07-05T11:36:44.496275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.10068v1","created_at":"2026-07-05T11:36:44.496275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10068","created_at":"2026-07-05T11:36:44.496275+00:00"},{"alias_kind":"pith_short_12","alias_value":"22QMWVZ6BA2T","created_at":"2026-07-05T11:36:44.496275+00:00"},{"alias_kind":"pith_short_16","alias_value":"22QMWVZ6BA2T6CQV","created_at":"2026-07-05T11:36:44.496275+00:00"},{"alias_kind":"pith_short_8","alias_value":"22QMWVZ6","created_at":"2026-07-05T11:36:44.496275+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/22QMWVZ6BA2T6CQV5LSOINJR3P","json":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P.json","graph_json":"https://pith.science/api/pith-number/22QMWVZ6BA2T6CQV5LSOINJR3P/graph.json","events_json":"https://pith.science/api/pith-number/22QMWVZ6BA2T6CQV5LSOINJR3P/events.json","paper":"https://pith.science/paper/22QMWVZ6"},"agent_actions":{"view_html":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P","download_json":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P.json","view_paper":"https://pith.science/paper/22QMWVZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.10068&json=true","fetch_graph":"https://pith.science/api/pith-number/22QMWVZ6BA2T6CQV5LSOINJR3P/graph.json","fetch_events":"https://pith.science/api/pith-number/22QMWVZ6BA2T6CQV5LSOINJR3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P/action/storage_attestation","attest_author":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P/action/author_attestation","sign_citation":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P/action/citation_signature","submit_replication":"https://pith.science/pith/22QMWVZ6BA2T6CQV5LSOINJR3P/action/replication_record"}},"created_at":"2026-07-05T11:36:44.496275+00:00","updated_at":"2026-07-05T11:36:44.496275+00:00"}