Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are linearly independent over F. We obtain near-optimal upper bounds for NF(n, k
Paritycheckmatricesandproductrepresentationsofsquares
AssafNaor
MicrosoftResearch
anaor@microsoft.comJacquesVerstra¨eteUniversityofWaterloojverstra@math.uwaterloo.ca
Abstract
LetNF(n,k,r)denotethemaximumnumberofcolumnsinann-rowmatrixwithentriesina nite eldFinwhicheachcolumnhasatmostrnonzeroentriesandeverykcolumnsarelinearlyindependentoverF.Weobtainnear-optimalupperboundsforNF(n,k,r)inthecasercrk>r.Namely,weshowthatNF(n,k,r) n+wherec≈4
forlargek.Ourmethodis
basedonanovelreductionoftheproblemtotheextremalproblemforcyclesingraphs,andyieldsafastalgorithmfor ndingshortlineardependences.Wepresentadditionalapplicationsofthismethodtoproblemsinextremalhypergraphtheoryandcombinatorialnumbertheory.“Itiscertainlyoddtohaveaninstructioninanalgorithmaskingyoutoplaywithsomenumbersto ndasubsetwithproductasquare...Whyshouldweexpectto ndsuchasubsequence,and,ifitexists,howcanwe ndite ciently?”
CarlPomerance[32].1IntroductionSincethemid-1930sithasbeenwellestablishedthatthereisatightconnectionbetweencombi-natorialnumbertheoryandextremalcombinatorics(see[33,12]andthereferencestherein).Thebasicparadigmisthatforcertainnumbertheoreticalproblemsonecanconstructacombinatorialobject(e.g.agraphorahypergraph),andprovethatitcannotcontaincertaincon gurations(e.g.cycles).Thus,inmanycasesonecanusetheoremsonexcludedcon gurationsinextremalcombi-natoricstoboundthesizeofthecombinatorialstructurethatwasconstructed,andthistranslatesbacktogivenumbertheoreticalconsequences.Thepresentpaperdevelopsanovelreductionofthistype,andappliesittotwoproblemsinalgebraiccombinatorics,namelytocodingtheoryandcombinatorialnumbertheory.Additionally,ourproofsareconstructive,andthusyieldthebestknownalgorithmsforseveralnaturalcomputationalproblems.
Ouroriginalmotivationcomesfromaproblemincodingtheory.LowdensityparitycheckcodeswereintroducedbyGallagerinthe1960s,andhavesincefoundnumeroustheoreticalandpracticalapplicationsinengineeringandcomputerscience(see[22,29,30]foranaccountofthistheory.Wealsoreferto[11]foraniceintroductiontothegeometryofcodes).GivenalinearcodeC Fm2ofdimension andminimumHammingweightt,an(m )×mmatrixHiscalledaparitycheckmatrixofthecodeCifC={v∈Fm2:Hv=0}.WeshallsaythatHisr-sparseifeverycolumnofHhasatmostrnon-zeroentries.TheSyndromeDecodingAlgorithmforsuchcodesworksasfollows:givenacorruptedsignalzonecomputesthevectorxofminimalweight
1
Addendum to “Explicit matrices for irreducible representations of Weyl groups...1 is a direct product of parabolic subgroups, say WI × WJ , with ...
12页 5财富值 Parity check matrices an... 暂无评价 18页 免费... M. Intuitive and Formal Representations The Case of Matrices Abstract. A ...
UFSCARF-TH-04-15 New R-matrices from Representations of Braid-Monoid ...ned on the tensor product of two N-dimensional vectors spaces Va and Vb ...
Spectra of random linear combinations of matrices defined via representations and Coxeter g We consider the asymptotic behavior as $n \to \infty$ of the...
Junkins Abstract Three and four parameter representations of 3x3 orthogonal matrices are extended to the general case of proper NxN orthogonal matrices. These...
representations of the complex Lie algebra 91(N) of all N x N matrices,...and N are assumed of definite parity and a is 0 on even elements and ...
In fact, Eve doesn’t know the matrix H1,H2 and G2 because the generation matrices G1,G2 and the parity check matrices H1,H2, are Bob’s ...
Linear Representations o... 暂无评价 40页 免费...maximal groups of 17 × 17 integer matrices [8...addition of an over-all parity check in position...
representations of the decoding problems for both ...ned by its parity-check matrix A, which has ...and C2 are K × M and K × K matrices, ...
REGULAR LOW-DENSITY PARITY-CHECK CODES BASED ON SHIFTED IDENTITY MATRICES_专业资料。维普资讯 http://www.cqvip.com V13o1O2N _. . JUNLO LCRNI CI)ORA ...
热门文档