Download now Free registration required
The authors describe a novel extension of subspace codes for non-coherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. They show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the network and when the min-cut of the networks is much smaller than the length of the transmitted code words, the new family of codes outperforms their subspace code counterparts.
- Format: PDF
- Size: 250.5 KB