Abstract
Recently, linear codes with few weights have been constructed through defining sets. Results show that some optimal codes can be obtained if the defining sets were well chosen. In this paper, we investigate the linear codes constructed from the absolute trace function. It is shown that the constructed codes are binary linear codes with three weights. The dual codes of the proposed linear codes are also studied and proved to be optimal or almost optimal.
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2loamJe
via IFTTT
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου