Show simple item record

dc.contributor.authorJiang, Wenen_US
dc.date.accessioned2007-03-27T18:20:29Z
dc.date.available2007-03-27T18:20:29Z
dc.date.issued2006-11-20en_US
dc.identifier.urihttp://hdl.handle.net/1853/14072
dc.description.abstractWe study codes that have identifiable parent property. Such codes are called IPP codes. Research on IPP codes is motivated by design of schemes that protect against piracy of digital products. Construction and decoding of maximum IPP codes have been studied in rich literature. General bounds on F(n,q), the maximum size of IPP codes of length n over an alphabet with q elements, have been obtained through the use of techniques from graph theory and combinatorial design. Improved bounds on F(3,q) and F(4,q) are obtained. Probabilistic techniques are also used to prove the existence of certain IPP codes. We prove a precise formula for F(3,q), construct maximum IPP codes with size F(3,q), and give an efficient decoding algorithm for such codes. The main techniques used in this thesis are from graph theory and nonlinear optimization. Our approach may be used to improve bounds on F(2k+1, q). For example, we characterize the associated graphs of maximum IPP codes of length 5, and obtain bounds on F(5,q).en_US
dc.format.extent633437 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectGraph theoryen_US
dc.subjectIPP codesen_US
dc.subject.lcshGraph theoryen_US
dc.subject.lcshCryptographyen_US
dc.subject.lcshCiphersen_US
dc.titleMaximum Codes with the Identifiable Parent Propertyen_US
dc.typeDissertationen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMathematicsen_US
dc.description.advisorCommittee Chair: Yu, Xingxing; Committee Member: Dieci, Luca; Committee Member: Li, Ye; Committee Member: Thomas, Robin; Committee Member: Trotter, Williamen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record