Let K be a permutation group acting on binary vectors of length n and F K be a code of length 2 n consisting of all binary functions with nontrivial inertia group in K. We obtain upper and lower bounds on the covering radii of F K , where K are certain subgroups of the affine permutation group GA n . We also obtain estimates for distances between F K and almost all functions in n variables as n → ∞. We prove the existence of functions with the trivial inertia group in GA n for all n ≥ 7. An upper bound for the asymmetry of a k-uniform hypergraph is obtained.
Problems of Information Transmission – Springer Journals
Published: Oct 9, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud