Sign codes from number fields
Three new families of binary linear codes are created from a number field. They are created by looking at the “signs” of the embedding of the units into the real numbers, the 2-adic numbers and then a combination of the two embeddings. The transmission rates of these codes are described in terms of...
Main Author: | |
---|---|
Language: | ENG |
Published: |
ScholarWorks@UMass Amherst
1999
|
Subjects: | |
Online Access: | https://scholarworks.umass.edu/dissertations/AAI9950190 |
id |
ndltd-UMASS-oai-scholarworks.umass.edu-dissertations-3273 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UMASS-oai-scholarworks.umass.edu-dissertations-32732020-12-02T14:34:37Z Sign codes from number fields Murray, Maura Ann Three new families of binary linear codes are created from a number field. They are created by looking at the “signs” of the embedding of the units into the real numbers, the 2-adic numbers and then a combination of the two embeddings. The transmission rates of these codes are described in terms of the class group of the number field. Then lower bounds are found for the transmission rates of the codes. In the case of the real sign code, heuristic results of Cohen and Lenstra are used to determine the probability of certain rates occurring. A property of the minimum distance is discussed and a relationship between the minimum distances of the three codes is proven. 1999-01-01T08:00:00Z text https://scholarworks.umass.edu/dissertations/AAI9950190 Doctoral Dissertations Available from Proquest ENG ScholarWorks@UMass Amherst Mathematics |
collection |
NDLTD |
language |
ENG |
sources |
NDLTD |
topic |
Mathematics |
spellingShingle |
Mathematics Murray, Maura Ann Sign codes from number fields |
description |
Three new families of binary linear codes are created from a number field. They are created by looking at the “signs” of the embedding of the units into the real numbers, the 2-adic numbers and then a combination of the two embeddings. The transmission rates of these codes are described in terms of the class group of the number field. Then lower bounds are found for the transmission rates of the codes. In the case of the real sign code, heuristic results of Cohen and Lenstra are used to determine the probability of certain rates occurring. A property of the minimum distance is discussed and a relationship between the minimum distances of the three codes is proven. |
author |
Murray, Maura Ann |
author_facet |
Murray, Maura Ann |
author_sort |
Murray, Maura Ann |
title |
Sign codes from number fields |
title_short |
Sign codes from number fields |
title_full |
Sign codes from number fields |
title_fullStr |
Sign codes from number fields |
title_full_unstemmed |
Sign codes from number fields |
title_sort |
sign codes from number fields |
publisher |
ScholarWorks@UMass Amherst |
publishDate |
1999 |
url |
https://scholarworks.umass.edu/dissertations/AAI9950190 |
work_keys_str_mv |
AT murraymauraann signcodesfromnumberfields |
_version_ |
1719364768045727744 |