~

codes/classical/bits/nonlinear/gray_map/originals/nadler.yml

@@ -8,20 +8,23 @@ physical: bits
 logical: bits
 
 name: 'Nadler code'
-introduced: '\cite{manual:{W. W. Peterson, “Some new results on finite fields with applications to BCH codes,” in Combinatorial Mathematics and Its Applications, R. C. Bose and T. A. Dowlinr. Eds. Chaoel Hill. N.C.: Univ. North Carolina Press, 1969.}}'
+introduced: '\cite{doi:10.1109/TIT.1962.1057670}'
 
 description: |
-  A nonlinear \((12,35,5)\) binary code that is the largest double-error-correcting code; see construction due to Van Lint \cite{doi:10.1109/TIT.1972.1054904} presented in \cite[Ch. 2, Sec. 8]{preset:MacSlo}.
-
+  A nonlinear \((12,35,5)\) binary code that is the largest double-error-correcting code.
+  
+  An inequivalent code with the same parameters was constructed by Van Lint \cite{doi:10.1109/TIT.1972.1054904} and presented in \cite[Ch. 2, Sec. 8]{preset:MacSlo}.
   Its automorphism group is a subgroup of \(S_3\times S_4\) \cite{doi:10.1109/TIT.1972.1054904}.
 
+  While the two codes are inequivalent, the \((13,64,5)\) extension of both codes is unique and is a shortened NR code \cite{doi:10.1109/TIT.1977.1055665}.
+
 
 relations:
   parents:
     - code_id: bits_into_bits
   cousins:
     - code_id: nordstrom_robinson
-      detail: 'The NR code is an extension of the Nadler code \cite{doi:10.1109/TIT.1972.1054904}.'
+      detail: 'The NR code is an extension of the Nadler code \cite{doi:10.1109/TIT.1972.1054904,doi:10.1109/TIT.1977.1055665}.'
 
 
 # Begin Entry Meta Information