<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karima Chatouh</style></author><author><style face="normal" font="default" size="100%">kenza Guenda</style></author><author><style face="normal" font="default" size="100%">T Aaron Gulliver</style></author><author><style face="normal" font="default" size="100%">Lemnouar Noui</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On some classes of linear codes over Z2Z4 and their covering radii</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Applied Mathematics and Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><volume><style face="normal" font="default" size="100%">53</style></volume><pages><style face="normal" font="default" size="100%">201–222</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we define the simplex and MacDonald codes of types&amp;nbsp;αα&amp;nbsp;and&amp;nbsp;β&amp;nbsp;over&amp;nbsp;Z2Z4. We also examine the covering radii of these codes. Further, we study the binary images of these codes and prove that the binary image of the simplex codes of type&amp;nbsp;αα&amp;nbsp;meets the Gilbert bound.</style></abstract></record></records></xml>