𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound

✍ Scribed by C Roos

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
202 KB
Volume
33
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A general upper bound for the cyclic chr
A general upper bound for the cyclic chromatic number of 3-connected plane graphs
✍ Hikoe Enomoto; Mirko HorňÑk πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 457 KB πŸ‘ 1 views

## Abstract The cyclic chromatic number of a plane graph __G__ is the smallest number Ο‡~__c__~(__G__) of colors that can be assigned to vertices of __G__ in such a way that whenever two distinct vertices are incident with a common face, they receive distinct colors. It was conjectured by Plummer an

A better bound for the cop number of gen
A better bound for the cop number of general graphs
✍ Ehsan Chiniforooshan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 85 KB

## Abstract In this note, we prove that the cop number of any __n__‐vertex graph __G__, denoted by ${{c}}({{G}})$, is at most ${{O}}\big({{{n}}\over {{\rm lg}} {{n}}}\big)$. Meyniel conjectured ${{c}}({{G}})={{O}}(\sqrt{{{n}}})$. It appears that the best previously known sublinear upper‐bound is du

A General Upper Bound for the Satisfiabi
A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
✍ O Dubois; Y Boufkhad πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 280 KB

Experiments on solving r-SAT random formulae have provided evidence of a satisfiability threshold phenomenon with respect to the ratio of the number of clauses to the number of variables of formulae. Presently, only the threshold of 2-SAT formulae has been proved to exist and has been computed to be