Staff View
Properties of LDGM-LDPC codes with applications to secrecy coding

Descriptive

TypeOfResource
Text
TitleInfo (ID = T-1)
Title
Properties of LDGM-LDPC codes with applications to secrecy coding
Identifier
ETD_2566
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053153
Language
LanguageTerm (authority = ISO639-2); (type = code)
eng
Genre (authority = marcgt)
theses
Subject (ID = SBJ-1); (authority = RUETD)
Topic
Electrical and Computer Engineering
Subject (ID = SBJ-2); (authority = ETD-LCSH)
Topic
Information theory
Subject (ID = SBJ-3); (authority = ETD-LCSH)
Topic
Coding theory
Abstract (type = abstract)
The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been proposed in literature. In this thesis, an irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly emph{punctured} output-bits. It is shown that the LDGM-LDPC codes achieve rates arbitrarily close to the channel-capacity of the binary-input symmetric-output memoryless (BISOM) channel with a finite lower-bound on the emph{complexity}. The measure of complexity is the average-degree (per information-bit) of the check-nodes for the factor-graph of the code. A lower-bound on the average degree of the check-nodes of the irregular LDGM-LDPC codes is obtained. The bound does not depend on the decoder used at the receiver. The stability condition for decoding the irregular LDGM-LDPC codes over the binary-erasure channel (BEC) under iterative-decoding with message-passing is described. The LDGM-LDPC codes are capacity achieving with bounded complexity and possess natural binning/nesting structure. These codes are applied to secrecy coding. The problem of secrecy coding for the type-II binary symmetric memoryless wiretap channel is studied. In this model, the main channel is binary-input and noiseless and the eavesdropper channel is binary-symmetric memoryless. A coding strategy based on emph{secure nested codes} is proposed. A capacity achieving length-$n$ code for the eavesdropper channel bins the space ${0,1}^n$ into co-sets which are used for secret messaging. The resulting co-set scheme achieves secrecy capacity of the type-II binary symmetric memoryless channel. As an example, the ensemble of capacity-achieving regular low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes is studied as a basis for binning. The previous result is generalized to the case of a noisy main-channel. The problem of secrecy-coding for a specific type-I wiretap channel is studied. In the type-I wiretap channel under consideration, the main channel is a binary-input symmetric-output memoryless (BISOM) channel and the eavesdropper channel is a binary-symmetric channel (BSC). A secure-nested-code that achieves perfect-secrecy for the above type-I channel is proposed. The secure-nested-code is based on a nested regular LDGM-LDPC code construction.
PhysicalDescription
Form (authority = gmd)
electronic resource
Extent
viii, 44 p. : ill.
InternetMediaType
application/pdf
InternetMediaType
text/xml
Note (type = degree)
M.S.
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Manik Raina
Note
Includes abstract
Name (ID = NAME-1); (type = personal)
NamePart (type = family)
Raina
NamePart (type = given)
Manik
Role
RoleTerm (authority = RULIB)
author
DisplayForm
Manik Raina
Name (ID = NAME-2); (type = personal)
NamePart (type = family)
Spasojevic
NamePart (type = given)
Predrag
Role
RoleTerm (authority = RULIB)
chair
Affiliation
Advisory Committee
DisplayForm
Predrag Spasojevic
Name (ID = NAME-3); (type = personal)
NamePart (type = family)
Yates
NamePart (type = given)
Roy
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Roy Yates
Name (ID = NAME-4); (type = personal)
NamePart (type = family)
Trappe
NamePart (type = given)
Wade
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Wade Trappe
Name (ID = NAME-1); (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (ID = NAME-2); (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
OriginInfo
DateCreated (qualifier = exact)
2010
DateOther (qualifier = exact); (type = degree)
2010
Place
PlaceTerm (type = code)
xx
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3B27VCT
Genre (authority = ExL-Esploro)
ETD graduate
Back to the top

Rights

RightsDeclaration (AUTHORITY = GS); (ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
RightsHolder (ID = PRH-1); (type = personal)
Name
FamilyName
Raina
GivenName
Manik
Role
Copyright Holder
RightsEvent (ID = RE-1); (AUTHORITY = rulib)
Type
Permission or license
DateTime
2010-04-10 02:37:44
AssociatedEntity (ID = AE-1); (AUTHORITY = rulib)
Role
Copyright holder
Name
Manik Raina
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject (ID = AO-1); (AUTHORITY = rulib)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top

Technical

ContentModel
ETD
MimeType (TYPE = file)
application/pdf
MimeType (TYPE = container)
application/x-tar
FileSize (UNIT = bytes)
348160
Checksum (METHOD = SHA1)
a87a3948f0bd43719e586d826dd7994ed3de86cf
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2021