Hamming distance from irreducible polynomials over $\mathbb {F}_2$

We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that...

詳細記述

書誌詳細

出版年:	Discrete Mathematics & Theoretical Computer Science
主要な著者:	Gilbert Lee, Frank Ruskey, Aaron Williams
フォーマット:	論文
言語:	英語
出版事項:	Discrete Mathematics & Theoretical Computer Science 2007-01-01
主題:	irreducible polynomials random polynomials hamming distance finite fields binary strings asymptotics exhaustive enumeration [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-cg] computer science [cs]/computational geometry [cs.cg]
オンライン･アクセス:	https://dmtcs.episciences.org/3550/pdf