You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: codes/classical/rings/dual/dual_over_rings.yml
+12-12Lines changed: 12 additions & 12 deletions
Original file line number
Diff line number
Diff line change
@@ -10,18 +10,18 @@ logical: rings
10
10
name: 'Dual linear code over \(R\)'
11
11
12
12
description: |
13
-
For any linear code \(C\) over a ring \(R\), the dual code is the set of strings that are orthogonal to the codewords of \(C\) under a particular inner product.
14
-
15
-
The dual code over \(R\) is a linear code defined by
where the \textit{ordinary}, \textit{standard}, or \textit{Euclidean} inner product is \(x\cdot y = \sum_{i=1}^n x_i y_i\) for coordinates \(x_i,y_i\).
20
-
21
-
A code that is contained in its dual, \(C \subseteq C^\perp\), is called \textit{self-orthogonal over \(R\)} or \textit{weakly self-dual over \(R\)}.
22
-
A code that contains its dual, \(C^\perp \subseteq C\), is called \textit{dual-containing over \(R\)}.
23
-
A code that is equal to its dual, \(C^\perp = C\), is called self-dual over \(R\).
24
-
A code is dual-containing over \(R\) iff its dual is self-orthogonal over \(R\).
13
+
For any linear code \(C\) over a ring \(R\), the dual code is the set of strings that are orthogonal to the codewords of \(C\) under some inner product.
14
+
15
+
# The dual code over \(R\) is a linear code defined by
# where the \textit{ordinary}, \textit{standard}, or \textit{Euclidean} inner product is \(x\cdot y = \sum_{i=1}^n x_i y_i\) for coordinates \(x_i,y_i\).
20
+
21
+
# A code that is contained in its dual, \(C \subseteq C^\perp\), is called \textit{self-orthogonal over \(R\)} or \textit{weakly self-dual over \(R\)}.
22
+
# A code that contains its dual, \(C^\perp \subseteq C\), is called \textit{dual-containing over \(R\)}.
23
+
# A code that is equal to its dual, \(C^\perp = C\), is called self-dual over \(R\).
24
+
# A code is dual-containing over \(R\) iff its dual is self-orthogonal over \(R\).
0 commit comments