國立高雄大學圖資館 |

Language: English

Back

On Dyadic Parity Check Codes and Their Generalizations /

Record Type:	Electronic resources : Monograph/item
Title/Author:	On Dyadic Parity Check Codes and Their Generalizations /Meraiah Martinez.
Author:	Martinez, Meraiah,
Description:	1 electronic resource (89 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 85-06, Section: B.
Notes:	Advisors: Kelley, Christine Committee members: Radcliffe, Jamie; Perez-Gimenez, Xavier; Walker, Mark; Variyam, Vinod.
Contained By:	Dissertations Abstracts International85-06B.
Subject:	Mathematics.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30814218
ISBN:	9798381095869

On Dyadic Parity Check Codes and Their Generalizations /
Martinez, Meraiah,

On Dyadic Parity Check Codes and Their Generalizations /Meraiah Martinez. - 1 electronic resource (89 pages)

Source: Dissertations Abstracts International, Volume: 85-06, Section: B.

In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don't prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low-complexity graph-based decoding algorithms. Various graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis.This dissertation focuses on codes based on parity check matrices that are dyadic, n-adic, or quasi-dyadic (QD), meaning the parity check matrix representation is block structured with dyadic matrices as blocks. Depending on the number of nonzero positions in the leading row of each block, these codes may be either low density or moderate density. Since each block is reproducible, the resulting QD codes have similar advantages to quasi-cyclic (QC) codes. We examine basic code properties of dyadic, n-adic, and QD parity check codes, including bounds on the dimension and minimum distance, cycle structure of the corresponding Tanner graph, and their possible use in quantum code constructions. We also consider the relationship between cycle codes of graphs and cycle codes of their lifts.

English

ISBN: 9798381095869Subjects--Topical Terms:

184409
Mathematics.
Subjects--Index Terms:

Low-density parity check

On Dyadic Parity Check Codes and Their Generalizations /
LDR:02974nmm a22004213i 4500 001 676276
005 20250420214332.5
006 m o d
007 cr|nu||||||||
008 250901s2023 miu||||||m |||||||eng d
020 $a 9798381095869
035 $a (MiAaPQD)AAI30814218
035 $a AAI30814218
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Martinez, Meraiah, $e author. $3 990020
245 1 0 $a On Dyadic Parity Check Codes and Their Generalizations / $c Meraiah Martinez.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 1 electronic resource (89 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-06, Section: B.
500 $a Advisors: Kelley, Christine Committee members: Radcliffe, Jamie; Perez-Gimenez, Xavier; Walker, Mark; Variyam, Vinod.
502 $b Ph.D. $c The University of Nebraska - Lincoln $d 2023.
520 $a In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don't prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low-complexity graph-based decoding algorithms. Various graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis.This dissertation focuses on codes based on parity check matrices that are dyadic, n-adic, or quasi-dyadic (QD), meaning the parity check matrix representation is block structured with dyadic matrices as blocks. Depending on the number of nonzero positions in the leading row of each block, these codes may be either low density or moderate density. Since each block is reproducible, the resulting QD codes have similar advantages to quasi-cyclic (QC) codes. We examine basic code properties of dyadic, n-adic, and QD parity check codes, including bounds on the dimension and minimum distance, cycle structure of the corresponding Tanner graph, and their possible use in quantum code constructions. We also consider the relationship between cycle codes of graphs and cycle codes of their lifts.
546 $a English
590 $a School code: 0138
650 4 $a Mathematics. $3 184409
650 4 $a Applied mathematics. $3 377601
650 4 $a Information technology. $3 184390
653 $a Low-density parity check
653 $a Quasi-dyadic
653 $a Parity check matrix
653 $a Cycle codes
690 $a 0405
690 $a 0489
690 $a 0364
710 2 $a The University of Nebraska - Lincoln. $b Mathematics. $e degree granting institution. $3 990021
720 1 $a Kelley, Christine $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 85-06B.
790 $a 0138
791 $a Ph.D.
792 $a 2023
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30814218