Sum code family formation method with undetectable error minimum in data vectors
The research results of the methods for formation of separable sum codes with the minimum number of undetectable errors in data vectors are presented. A formula for counting the number of undetectable errors in data vectors and codes family properties are given. A universal method for formation of s...
Saved in:
| Main Authors: | D. V. Efanov, V. V. Sapozhnikov, Vl. V. Sapozhnikov |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2019-09-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/803 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Undetectable = Untransmittable: A Cross-Population Systematic Review and Meta-Analysis on Awareness and Acceptance
by: Nikolaos Georgiadis, et al.
Published: (2025-07-01) -
Deep learning enhanced quantum holography with undetected photons
by: Weiru Fan, et al.
Published: (2024-12-01) -
An Approach Based on Sum Product Networks for Code Smells Detection
by: Mostefai Abdelkader
Published: (2025-06-01) -
New non-primitive codes formed from primitive BCH and Hamming codes and their norm evaluation
by: V. K. Konopelko, et al.
Published: (2019-06-01) -
Soft value flipping decoding algorithm for LDPC codes based on adjoint vectors sum
by: LIU Jian-quan1, et al.
Published: (2009-01-01)