| dc.contributor.author | Schwartz, Moshe | |
| dc.contributor.author | Medard, Muriel | |
| dc.date.accessioned | 2021-11-09T19:03:47Z | |
| dc.date.available | 2021-11-09T15:13:45Z | |
| dc.date.available | 2021-11-09T19:03:47Z | |
| dc.date.issued | 2014-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/137909.2 | |
| dc.description.abstract | © 2014 IEEE. We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and then quantizing it to a vector non-linear network code using a fixed-point representation. Apart from describing the method, we draw some links between some network parameters and the rate of the resulting code. | en_US |
| dc.language.iso | en | |
| dc.publisher | IEEE | en_US |
| dc.relation.isversionof | 10.1109/netcod.2014.6892126 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Quasi-linear network coding | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Schwartz, Moshe and Medard, Muriel. 2014. "Quasi-linear network coding." | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Research Laboratory of Electronics | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2019-06-20T17:10:07Z | |
| dspace.date.submission | 2019-06-20T17:10:08Z | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Publication Information Needed | en_US |
