The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recently, linear codes with a few weights have been constructed and extensively studied. In this paper, for an odd prime p , we determine the complete weight enumerator of two classes of p -ary linear codes constructed from defining set. Our results show that the codes have at most seven weights and may have applications in secret sharing schemes.
Recently, linear codes constructed from defining sets have been studied extensively. They may have a few weights if the defining set is chosen properly. Let m and t be positive integers. For an odd prime p , let r = p m and Tr be the absolute trace function from F r to F p . In this paper, for b ∈ F p ∗ , we define D b = ( x 1 , … , x t )...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.