Restricted HammingHuffman trees
We study a special case of HammingHuffman trees, in which both data compression and data error detection are tackled on the same structure. Given a hypercube Qn of dimension n, we are interested in some aspects of its vertex neighborhoods. For a subset L of vertices of Qn, the neighborhood of L is d...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |