The sphere-packing bound gives an inequality relating the size of the code, length of the codewords, the size of the alphabet and the error- correction capacity What is the largest number of codewords...

I need the answer as soon as possible

Extracted text: The sphere-packing bound gives an inequality relating the size of the code, length of the codewords, the size of the alphabet and the error- correction capacity What is the largest number of codewords possible, according to the sphere-packing bound, in a 2-error-correcting code consisting of length 8 codewords over F,? O 5764801 O 1057 5453 O 117649