Right, but his problem is equivalent to bounded-weight, not constant-weight codes...
On Thu, Oct 16, 2008 at 10:04 PM, Vladimir Nesov <[EMAIL PROTECTED]> wrote: > On Fri, Oct 17, 2008 at 5:31 AM, Ben Goertzel <[EMAIL PROTECTED]> wrote: > > > > I still think this combinatorics problem is identical to the problem of > > calculating the efficiency of bounded-weight binary codes, as I > explained > > in a prior email... > > > > Yes, it seems to be a well-known problem. > http://en.wikipedia.org/wiki/Constant-weight_code > > (2 Charles: "Apart from some trivial observations, it is generally > impossible to compute these numbers in a straightforward way.") > > A(N, 2*(S-O+1), S) is the answer to Ed's problem (it's maximum size of > constant-weight binary code, not bounded-weight though). > > My lower bound is trivial, and answers the question. It's likely > somewhere in the references there. > > -- > Vladimir Nesov > [EMAIL PROTECTED] > http://causalityrelay.wordpress.com/ > > > ------------------------------------------- > agi > Archives: https://www.listbox.com/member/archive/303/=now > RSS Feed: https://www.listbox.com/member/archive/rss/303/ > Modify Your Subscription: > https://www.listbox.com/member/?&; > Powered by Listbox: http://www.listbox.com > -- Ben Goertzel, PhD CEO, Novamente LLC and Biomind LLC Director of Research, SIAI [EMAIL PROTECTED] "Nothing will ever be attempted if all possible objections must be first overcome " - Dr Samuel Johnson ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=117534816-b15a34 Powered by Listbox: http://www.listbox.com
