Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps...
Transcript of Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps...
![Page 1: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/1.jpg)
Formally Self-Dual Codes and Gray Maps
Steven T. Dougherty
May 24, 2012
![Page 2: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/2.jpg)
Introduction
I Linear code of length n – submodule of Rn
I [v,w] =∑
viwi
I C⊥ = {v | [v,w] = 0, ∀w ∈ C}
![Page 3: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/3.jpg)
Introduction
I Linear code of length n – submodule of Rn
I [v,w] =∑
viwi
I C⊥ = {v | [v,w] = 0, ∀w ∈ C}
![Page 4: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/4.jpg)
Introduction
I Linear code of length n – submodule of Rn
I [v,w] =∑
viwi
I C⊥ = {v | [v,w] = 0, ∀w ∈ C}
![Page 5: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/5.jpg)
Introduction
I R Frobenius ⇒ |C ||C⊥| = |R|n.
I C = C⊥ the code is self-dual.
I WC (y) =∑
c∈C ywt(c).
I WC (y) = WC⊥(y) the code is formally self-dual.
![Page 6: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/6.jpg)
Introduction
I R Frobenius ⇒ |C ||C⊥| = |R|n.I C = C⊥ the code is self-dual.
I WC (y) =∑
c∈C ywt(c).
I WC (y) = WC⊥(y) the code is formally self-dual.
![Page 7: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/7.jpg)
Introduction
I R Frobenius ⇒ |C ||C⊥| = |R|n.I C = C⊥ the code is self-dual.
I WC (y) =∑
c∈C ywt(c).
I WC (y) = WC⊥(y) the code is formally self-dual.
![Page 8: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/8.jpg)
Introduction
I R Frobenius ⇒ |C ||C⊥| = |R|n.I C = C⊥ the code is self-dual.
I WC (y) =∑
c∈C ywt(c).
I WC (y) = WC⊥(y) the code is formally self-dual.
![Page 9: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/9.jpg)
Rings
I Z4 = {0, 1, 2, 3}
I Rk = F2[u1, u2, . . . , uk ]/〈u2i = 0, uiuj = ujui 〉I Ak = F2[v1, v2, . . . , vk ]/〈v2i = vi , vivj = vjvi 〉
![Page 10: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/10.jpg)
Rings
I Z4 = {0, 1, 2, 3}I Rk = F2[u1, u2, . . . , uk ]/〈u2i = 0, uiuj = ujui 〉
I Ak = F2[v1, v2, . . . , vk ]/〈v2i = vi , vivj = vjvi 〉
![Page 11: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/11.jpg)
Rings
I Z4 = {0, 1, 2, 3}I Rk = F2[u1, u2, . . . , uk ]/〈u2i = 0, uiuj = ujui 〉I Ak = F2[v1, v2, . . . , vk ]/〈v2i = vi , vivj = vjvi 〉
![Page 12: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/12.jpg)
Gray Maps
φZ4 : Z4 → F22
φZ4(0) = (00)
φZ4(1) = (01)
φZ4(2) = (11)
φZ4(3) = (10)
![Page 13: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/13.jpg)
Gray Maps
φR1(a+ bu1) = (b, a+ b)
φRk(a+ buk) = (φRk−1
(b), φRk−1(a) + φRk−1
(b))
![Page 14: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/14.jpg)
Gray Maps
φA1(a+ bv1) = (a, a+ b)
φAk(a+ buk) = (φAk−1
(a), φAk−1(a) + φAk−1
(b))
The maps φRkand φAk
are linear but the map φZ4 is not.The Lee weight is the Hamming weight of its binary image.
![Page 15: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/15.jpg)
Gray Maps
φA1(a+ bv1) = (a, a+ b)
φAk(a+ buk) = (φAk−1
(a), φAk−1(a) + φAk−1
(b))
The maps φRkand φAk
are linear but the map φZ4 is not.
The Lee weight is the Hamming weight of its binary image.
![Page 16: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/16.jpg)
Gray Maps
φA1(a+ bv1) = (a, a+ b)
φAk(a+ buk) = (φAk−1
(a), φAk−1(a) + φAk−1
(b))
The maps φRkand φAk
are linear but the map φZ4 is not.The Lee weight is the Hamming weight of its binary image.
![Page 17: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/17.jpg)
Inner Products
Over Ak , the Euclidean inner product is:
[v,w] =∑
viwi
and the Hermitian is
[v,w]H =∑
viwi
where vi = 1 + vi .
![Page 18: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/18.jpg)
TheoremIf C is a formally self-dual code over Z4,Rk or Ak then the imageunder the corresponding Gray map is a binary formally self-dualcode.
![Page 19: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/19.jpg)
Major Result
TheoremLet C be an odd formally self-dual binary code of even length n.Let C0 be the subcode of even vectors. The codeC = 〈{(0, 0, c) | c ∈ C0} ∪ {(1, 0, c) | c ∈ C − C0}, (1, 1, 1)〉 is aneven formally self-dual code of length n+2 with weight enumeratorWC = x2WC0,0(x , y)+xyWC1,0(x , y)+y2WC0,0(y , x)+xyWC1,0(y , x).The codeC = 〈{(0, 0, c) | c ∈ C0} ∪ {(1, 1, c) | c ∈ C − C0}, (1, 0, 1)〉 is anodd formally self-dual code of length n+2 with weight enumerator:WC = x2WC0,0(x , y)+y2WC1,0(x , y)+xyWC0,0(y , x)+xyWC1,0(y , x).Moreover, any code with these weight enumerators is a formallyself-dual code.
![Page 20: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/20.jpg)
Outline of Proof
I Let C be an odd formally self-dual code.
I There exists a vector t such that C = 〈C0, t〉, where C0 is thesubcode of even vectors.
I Cα,β = C0 + αt+ β1.
I C⊥ = D and let D0 be the subcode of D of even vectors.
I There exists a vector t′ such that D = 〈D0, t′〉.I Dα,β = D0 + αt′ + β1.
![Page 21: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/21.jpg)
Outline of Proof
I Let C be an odd formally self-dual code.
I There exists a vector t such that C = 〈C0, t〉, where C0 is thesubcode of even vectors.
I Cα,β = C0 + αt+ β1.
I C⊥ = D and let D0 be the subcode of D of even vectors.
I There exists a vector t′ such that D = 〈D0, t′〉.I Dα,β = D0 + αt′ + β1.
![Page 22: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/22.jpg)
Outline of Proof
I Let C be an odd formally self-dual code.
I There exists a vector t such that C = 〈C0, t〉, where C0 is thesubcode of even vectors.
I Cα,β = C0 + αt+ β1.
I C⊥ = D and let D0 be the subcode of D of even vectors.
I There exists a vector t′ such that D = 〈D0, t′〉.I Dα,β = D0 + αt′ + β1.
![Page 23: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/23.jpg)
Outline of Proof
I Let C be an odd formally self-dual code.
I There exists a vector t such that C = 〈C0, t〉, where C0 is thesubcode of even vectors.
I Cα,β = C0 + αt+ β1.
I C⊥ = D and let D0 be the subcode of D of even vectors.
I There exists a vector t′ such that D = 〈D0, t′〉.
I Dα,β = D0 + αt′ + β1.
![Page 24: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/24.jpg)
Outline of Proof
I Let C be an odd formally self-dual code.
I There exists a vector t such that C = 〈C0, t〉, where C0 is thesubcode of even vectors.
I Cα,β = C0 + αt+ β1.
I C⊥ = D and let D0 be the subcode of D of even vectors.
I There exists a vector t′ such that D = 〈D0, t′〉.I Dα,β = D0 + αt′ + β1.
![Page 25: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/25.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 26: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/26.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 27: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/27.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 28: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/28.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 29: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/29.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 30: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/30.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 31: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/31.jpg)
Outline of Proof
I C =⋃(vα,β,Cα,β)
I D =⋃(wα,β,Dα,β)
I We need [vα,β,wα′,β′ ] = [Cα,β,Dα,β].
I To insure linearity we need vα,β = αv1,0 + βv0,1 andwα,β = αw1,0 + βw0,1.
I v1,0 = (1, 0), v0,1 = (1, 1) and w1,0 = (0, 1), v0,1 = (1, 1)
I WC = WD =x2WC0,0(x , y)+ xyWC1,0(x , y)+ y2WC0,0(y , x)+ xyWC1,0(y , x).
I C and D are formally self-dual
![Page 32: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/32.jpg)
Odd formally self-dual codes
I There exist odd formally self-dual codes of all lengths over Ak
for all k .
I Linear odd formally self-dual codes exist over Z4 and Rk forall lengths greater than 1.
![Page 33: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/33.jpg)
Odd formally self-dual codes
I There exist odd formally self-dual codes of all lengths over Ak
for all k .
I Linear odd formally self-dual codes exist over Z4 and Rk forall lengths greater than 1.
![Page 34: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/34.jpg)
Formally self-dual codes
Let 2 be the all 2 vector in Zn4, u1u2 . . .uk be the all u1u2 . . . uk
vector in Rnk and 1 be the all one-vector (over any ring). Note that
the Gray image of these vectors is the binary all-one vector.
TheoremLet C be a formally self-dual code. The code C is even over Z4 ifand only if 2 ∈ C. The code C is even over Rk if and only ifu1u2 . . .uk ∈ C. The code C is even over Ak if and only if 1 ∈ C.
![Page 35: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/35.jpg)
Formally self-dual codes
Let 2 be the all 2 vector in Zn4, u1u2 . . .uk be the all u1u2 . . . uk
vector in Rnk and 1 be the all one-vector (over any ring). Note that
the Gray image of these vectors is the binary all-one vector.
TheoremLet C be a formally self-dual code. The code C is even over Z4 ifand only if 2 ∈ C. The code C is even over Rk if and only ifu1u2 . . .uk ∈ C. The code C is even over Ak if and only if 1 ∈ C.
![Page 36: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/36.jpg)
Formally self-dual codes
TheoremLet C be an odd formally self-dual code over Ak or Z4 of length n.Then C is a neighbor of an even formally self-dual code.
![Page 37: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/37.jpg)
Importance of these codes
I Formally self-dual codes over Rk produce binary formallyself-dual codes that have k distinct automorphisms
I Formally self-dual codes over Z4 produce non-linear formallyself-dual codes which may have higher minimum distance thanany linear formally self-dual codes.
I A formally self-dual code over Ak can be constructed usingany 2k−1 binary codes.
![Page 38: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/38.jpg)
Importance of these codes
I Formally self-dual codes over Rk produce binary formallyself-dual codes that have k distinct automorphisms
I Formally self-dual codes over Z4 produce non-linear formallyself-dual codes which may have higher minimum distance thanany linear formally self-dual codes.
I A formally self-dual code over Ak can be constructed usingany 2k−1 binary codes.
![Page 39: Formally Self-Dual Codes and Gray MapsACCT2012/p24.pdf · Formally Self-Dual Codes and Gray Maps Steven T. Dougherty May 24, 2012](https://reader033.fdocuments.net/reader033/viewer/2022041501/5e21df6ddd7129426601dbf8/html5/thumbnails/39.jpg)
Importance of these codes
I Formally self-dual codes over Rk produce binary formallyself-dual codes that have k distinct automorphisms
I Formally self-dual codes over Z4 produce non-linear formallyself-dual codes which may have higher minimum distance thanany linear formally self-dual codes.
I A formally self-dual code over Ak can be constructed usingany 2k−1 binary codes.