Let . We consider the family of all linear subspaces that satisfy the following three conditions:
-
The dimension of is 12.
-
The Hamming weight of every vector in is a multiple of 4.
-
The vector is contained in .
For any , let denote the number of vectors in having Hamming weight . It is a known theoretical result that the weight distribution sequence for any can be uniquely expressed as a linear combination of the weight distributions of two fixed "basis" codes, and , which are also in .
The basis codes are defined as follows:
- \textbf{Code }: The weight enumerator polynomial is given by:
- \textbf{Code }: This code has no vectors of weight 4 (i.e., ) and has exactly 759 vectors of weight 8 (i.e., ).
Let be a specific code in that contains exactly 6 vectors of weight 4.
Calculate the number of vectors in that have weight 12.
[THOUGHT] We are given that any code C $$\in$$ $$\mathcal{F}$$ has a weight distribution that is a linear combination of the weight distributions of two basis codes and . We are told:
- C^* $$\in$$ $$\mathcal{F}$$, so its weight distribution is A_k(C^*) = a $$\cdot$$ A_k(C_1) + b $$\cdot$$ A_k(C_2) for some scalars .
- has exactly 6 vectors of weight 4: .
- : weight enumerator
- : ,
We are to compute , the number of weight-12 vectors in .
Step 1: Expand to get for , etc.
Note: , so the exponent of is the weight.
We need to compute the coefficient of , , and in .
Let’s expand .
Let , ,
We are to expand , and collect terms where the total power of is 4, 8, 12.
- : only from , and has , so we need exactly one , and the rest or , but , so would overshoot.
So : only terms with exactly one , and two 's.
- :
- :
So term: \binom{3}{1} a^2 b = 3 $$\cdot$$ (x^8)^2 $$\cdot$$ (14x^4y^4) = 3 $$\cdot$$ x^{16} $$\cdot$$ 14x^4y^4 = 42 x^{20} y^4
So
- : can come from:
- Two 's: , and one :
- \binom{3}{2} a b^2 = 3 $$\cdot$$ x^8 $$\cdot$$ 196 x^8 y^8 = 588 x^{16} y^8
- One : , and two 's:
- \binom{3}{1} a^2 c = 3 $$\cdot$$ x^{16} $$\cdot$$ y^8 = 3 x^{16} y^8
- Other combinations? and : b $$\cdot$$ c = 14x^4y^4 $$\cdot$$ y^8 = 14x^4 y^{12} → too high
- : already done
- : only one , and : done
- Two 's: , and one :
So total : , so
- : terms with
- Three 's: , coefficient →
- One and one : b $$\cdot$$ c = 14x^4y^4 $$\cdot$$ y^8 = 14x^4 y^{12}, and one
- ways: choose which is , which is , which is
- 6 $$\cdot$$ x^8 $$\cdot$$ 14x^4y^4 $$\cdot$$ y^8 = 6 $$\cdot$$ 14 x^{12} y^{12} = 84 x^{12} y^{12}
- Two 's: , too high
- So only two cases: and
Thus
Now, for :
- We don’t know , but we can find it from the fact that is a 12-dimensional binary linear code of length 24, with all weights divisible by 4, and $$\mathbf{1}$$ $$\in$$ C_2. So , , and unless k $$\equiv$$ 0 \pmod{4}.
Also, since is in $$\mathcal{F}$$, its weight distribution is a linear combination of and , but is a basis, so we can use the known values.
But we are not given , but we can use the fact that , and we know
We have:
- A_4(C^*) = a $$\cdot$$ A_4(C_1) + b $$\cdot$$ A_4(C_2) = a $$\cdot$$ 42 + b $$\cdot$$ 0 = 42a
- Set equal to 6: 42a = 6 $$\Rightarrow$$ a = 6 / 42 = 1/7
Now, A_{12}(C^*) = a $$\cdot$$ A_{12}(C_1) + b $$\cdot$$ A_{12}(C_2)
We know ,
But we don’t know , nor
But we can use another known value: has
So A_8(C^*) = a $$\cdot$$ A_8(C_1) + b $$\cdot$$ A_8(C_2) = (1/7)(591) + b $$\cdot$$ 759
But we don’t know , so we need another way.
Wait — but is in $$\mathcal{F}$$, so it must satisfy:
- , so
- , , and unless k $$\equiv$$ 0 \pmod{4}
- We are to compute
We can use the fact that , and , so C^* = $$\frac{1}{7}$$ C_1 + b C_2
But is not known.
But since must be a linear code, and are basis codes, and is in $$\mathcal{F}$$, the coefficients must be such that has integer weight counts.
But we can use the total number of vectors: $$\sum_{k=0}^{24}$$ A_k = 4096
But we don’t know for all , but we can use the known values.
Alternatively, note that is a known code: it is likely the extended binary Golay code, but wait — the extended Golay code has , and , , etc.
In fact, the extended binary Golay code $$\mathcal{G}_{24}$$ is a code with , , , , , and , , and for k \not$$\equiv$$ 0 \pmod{4}.
So is the extended Golay code.
Similarly, :
Let’s compute : when , so , only from terms.
Each factor contributes , so , so
Similarly, , from terms.
Now, ,
But must have integer , so must be chosen so that are integers.
But we can use the fact that has , and , , so
Now, A_{12}(C^*) = (1/7) $$\cdot$$ 2828 + b $$\cdot$$ A_{12}(C_2)
But (known from extended Golay code)
So A_{12}(C^*) = 2828 / 7 + b $$\cdot$$ 2576
So
Now, must have total size 4096, and , , and for not divisible by 4.
But we can use another known value: must contain $$\mathbf{1}$$, so , , and is symmetric.
But we need to determine . But is not known.
Wait — but is a linear code, so must be integers, and must be rational.
But is in $$\mathcal{F}$$, so it must be a linear combination with rational coefficients, but since and are basis, and is in $$\mathcal{F}$$, it must be that is rational.
But we can use the fact that has , and must be determined.
But we don't know , but we can use the fact that must have A_8(C^*) = (1/7) $$\cdot$$ 591 + b $$\cdot$$ 759
— not integer!
But must be integer.
Contradiction?
Wait — , , so a $$\cdot$$ A_8(C_1) = 591 / 7 = 84.428... — not integer.
But must be integer.
So unless compensates, but is multiplied by 759, so must be rational.
But , not integer.
But must be integer, so (1/7)(591) + b $$\cdot$$ 759 must be integer.
But , not integer.
But — 7*84 = 588, 591 - 588 = 3, so
So
Set , but we need 84 + 3/7 + 759 b $$\in$$ $$\mathbb{Z}$$
So , so
But must be such that is integer.
But we have a problem: , , , so , so is fixed.
But A_8(C^*) = (1/7)(591) + b $$\cdot$$ 759 = 591/7 + 759 b
, not integer.
But must be integer.
So unless is chosen to make it integer, but is not free — is determined by , so , but is not determined yet.
But is in $$\mathcal{F}$$, so it must be a linear combination, but the coefficients must be such that all are integers.
But and are basis codes, so any C $$\in$$ $$\mathcal{F}$$ is , but must be rational.
But , so
Now,
Set this to be integer: 84 + 3/7 + 759 b = N $$\in$$ $$\mathbb{Z}$$
So
So b = $$\frac{7(N - 84) - 3}{7 \cdot 759}$$
Must be rational, but we need to be integer.
But we have another condition: must contain $$\mathbf{1}$$, so , which is satisfied since both and have , so
But , since $$\mathbf{1}$$ $$\in$$ C^*
So 1/7 + b = 1 $$\Rightarrow$$ b = 1 - 1/7 = 6/7
Oh! We forgot that contains $$\mathbf{1}$$, so
But A_{24}(C^*) = a $$\cdot$$ A_{24}(C_1) + b $$\cdot$$ A_{24}(C_2) = a $$\cdot$$ 1 + b $$\cdot$$ 1 = a + b
Set equal to 1:
We have , so
Now we can compute A_{12}(C^*) = a $$\cdot$$ A_{12}(C_1) + b $$\cdot$$ A_{12}(C_2) = (1/7)(2828) + (6/7)(2576)
Compute:
- 6 $$\cdot$$ 2576 = 15456
So
Now verify A_8(C^*) = (1/7)(591) + (6/7)(759) = (591 + 6 $$\cdot$$ 759)/7
Compute 6 $$\cdot$$ 759 = 4554
Integer, good.
, correct.
, good.
, good.
Now, total sum: $$\sum$$ A_k = 4096
We can check if makes sense.
But we have , and , , ,
Also
: from earlier, , so or or , etc.
From
: from and : , , so
: , times , so , and : but : gives , gives , so , and : so : ways, (14x^4y^4)^2 $$\cdot$$ y^8 = 196 $$\cdot$$ 14 x^8 y^{16}? No
: , then times , so , and , so 196 $$\cdot$$ 1 $$\cdot$$ x^8 y^{16}, and coefficient , so 3 $$\cdot$$ 196 = 588
: , and , so ways, 3 $$\cdot$$ 1 $$\cdot$$ x^8 y^{16}, so
not possible.
So
(since extended Golay code has )
So
Same as , which makes sense by symmetry.
Now , as computed.
So the answer is 2612.
But let me confirm : earlier I said , but let me double-check.
:
: from : , and , so
: (14x^4y^4)^2 $$\cdot$$ y^8 = 196 x^8 y^8 $$\cdot$$ y^8 = 196 x^8 y^{16}, not
: (14x^4y^4) $$\cdot$$ (y^8)^2 = 14 x^4 y^4 $$\cdot$$ y^{16} = 14 x^4 y^{20}, not
: x^8 $$\cdot$$ 14x^4y^4 $$\cdot$$ y^8 = 14 x^{12} y^{12}, and , so 6 $$\cdot$$ 14 = 84
: (x^8)^2 $$\cdot$$ y^8 = x^{16} y^8, not
: x^8 $$\cdot$$ y^{16}, not
: , as above
: 6 $$\cdot$$ 14 = 84
: , not
: , not
: from , from , so , not
So only and
:
: 6 $$\cdot$$ 14 = 84
Total , yes.
, known.
So A_{12}(C^*) = (1/7)(2828) + (6/7)(2576) = 404 + (6 $$\cdot$$ 2576)/7
6 $$\cdot$$ 2576 = 15456
Yes.
So the number of codewords of weight 12 in is 2612.
Final Answer