000 | 03260nam a22004693i 4500 | ||
---|---|---|---|
001 | EBC3113390 | ||
003 | MiAaPQ | ||
005 | 20240729124542.0 | ||
006 | m o d | | ||
007 | cr cnu|||||||| | ||
008 | 240724s2010 xx o ||||0 eng d | ||
020 |
_a9780821882023 _q(electronic bk.) |
||
020 | _z9780821849569 | ||
035 | _a(MiAaPQ)EBC3113390 | ||
035 | _a(Au-PeEL)EBL3113390 | ||
035 | _a(CaPaEBR)ebr10878845 | ||
035 | _a(OCoLC)774059195 | ||
040 |
_aMiAaPQ _beng _erda _epn _cMiAaPQ _dMiAaPQ |
||
050 | 4 | _aQA76.9.A25 -- C6675 2007eb | |
082 | 0 | _a005.8 | |
100 | 1 | _aBruen, Aiden A. | |
245 | 1 | 0 | _aError-Correcting Codes, Finite Geometries and Cryptography. |
250 | _a1st ed. | ||
264 | 1 |
_aProvidence : _bAmerican Mathematical Society, _c2010. |
|
264 | 4 | _c©2010. | |
300 | _a1 online resource (255 pages) | ||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
490 | 1 |
_aContemporary Mathematics ; _vv.523 |
|
505 | 0 | _aIntro -- Contents -- Cryptography -- Heterogeneous Hash Families and Covering Arrays -- Resilient Functions: Just How Resilient Are They? -- Quantum Coins -- Optimal Block Lengths for Secret Key Distillation -- Finite Geometries -- Hyperconics and Multiple Weight Codes for OCDMA -- Blocking Sets and Large Transversal-Free Systems of Mutually Orthogonal Latin Squares -- Incidence Matrices with Forbidden Configurations -- A New Method to Construct Maximal Partial Spreads of Smallest Size in PG(3, q) -- A Representation of the Projective Space P(r, k) on the Affine Plane A(2, k) and the Geometric Equivalence between the Veblen Configuration in P(3, k) and the Desargues Configuration in A(2, k) -- André Embeddings of Affine Planes -- Codes -- Near MDS Poset Codes and Distributions -- Geometric Constructions of Quantum Codes -- An Exact Analytical-Expression for the Read Sensor Signal in Magnetic Data Storage Channels -- Blocking Sets and Low-Weight Codewords in the Generalized Reed-MullerCodes -- Low-Power LDPC Decoding by Exploiting the Fault-Tolerance of the Sum-Product Algorithm -- On Perfect Codes over Non Prime Power Alphabets -- Linear Codes from Projective Spaces -- The Dimension of the Code of a Strongly Resolvable Design -- Codes of Nets and Projective Planes -- Minimum Output Symbol Error Variance of Forward Error Control Codes -- Multi-Stream Information Transmission in Random Power Attenuation Environments. | |
588 | _aDescription based on publisher supplied metadata and other sources. | ||
590 | _aElectronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. | ||
650 | 0 | _aComputer security -- Congresses. | |
650 | 0 | _aCryptography -- Congresses. | |
655 | 4 | _aElectronic books. | |
700 | 1 | _aWehlau, David L. | |
776 | 0 | 8 |
_iPrint version: _aBruen, Aiden A. _tError-Correcting Codes, Finite Geometries and Cryptography _dProvidence : American Mathematical Society,c2010 _z9780821849569 |
797 | 2 | _aProQuest (Firm) | |
830 | 0 | _aContemporary Mathematics | |
856 | 4 | 0 |
_uhttps://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3113390 _zClick to View |
999 |
_c68924 _d68924 |