On divisible codes over finite fields
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, introduced by Harold N. Ward, have the property that all codeword weights share a common divisor larger than 1. These are interesting error-correcting codes because many optimal codes and/or classical c...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2006
|
| Online Access: | https://thesis.library.caltech.edu/2055/1/thesis.pdf Liu, Xiaoyu (2006) On divisible codes over finite fields. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/96K8-Q767. https://resolver.caltech.edu/CaltechETD:etd-05252006-010331 <https://resolver.caltech.edu/CaltechETD:etd-05252006-010331> |
Internet
https://thesis.library.caltech.edu/2055/1/thesis.pdfLiu, Xiaoyu (2006) On divisible codes over finite fields. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/96K8-Q767. https://resolver.caltech.edu/CaltechETD:etd-05252006-010331 <https://resolver.caltech.edu/CaltechETD:etd-05252006-010331>