Constant weight codes with package CodingTheory.m in Mathematica The author offers a further development of the package CodingTheory.m [the author, Lect. Notes Comput. Sci. 2657, 737–746 (2003; Zbl 1033.94566)] in the direction of research of properties and parameters of constant weight codes (lower and upper bounds) and also using the Table of Constant Weight Binary Codes [online version, N. J. A. Sloane: Home Page∼njas/codes/Andw/] and the table of upper bounds on A(n,d,w) (which in many cases also gives lower bounds) maintained by E. Agrell, A. Vardy and K. Zeger, which is an electronic supplement to their paper “Upper bounds for constant-weight codes” [IEEE Trans. Inf. Theory 46, No. 7, 2373–2395 (2000; Zbl 0997.94036),∼agrell/bounds/cw.html]. The offered package allows one to carry out the comparative analysis of parameters of new codes with classical upper bounds such as Johnson bound, linear programming (Ph. Delsarte) bound, ..., and also with already available classes of codes. As an example we consider some construction of codes as union of two codes with parameters (n,2a,a+b) and (m,2b,a+b), that in some cases gives codes that are better than codes obtained with using Juxtaposing.