Error-corecting codes are used during most of data transmissions these days. To save space, we would like to use codes which are able to correct enough errors without extending the message too much. The expander codes look promising - they are asymptotically optimal, however, in practice they are just too long. Better expander constructions could be achieved via randomness con- ductors. In this thesis, we explain what conductors are and which constructions are possible for them. In the end we will convert them to expanders and almost get expander codes which are short enough for practical use but nevertheless good. 1
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:451040 |
| Date | January 2021 |
| Creators | Machová, Markéta |
| Contributors | Mareš, Martin, Hušek, Radek |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0026 seconds