In this paper we continue to study a question proposed by Babadi and Tarokh [4] on the mysterious randomness of Gold sequences. Upon improving their result, we establish the randomness of product of pseudorandom matrices formed from two linear block codes with respect to the empirical spectral distribution, if the dual distance of both codes is at least 5, hence providing an affirmative answer ...

All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. For those organizations that have been granted a photocopy license, a separate system of payment has been arranged. Authorization does not extend to othe...

Aimed at both newcomers to online learning as well as experienced multimedia developers, this paper addresses the issue of how to avoid unproductive multimedia instructional practices and employ more effective cognitive strategies. Baddeley’s model of working memory and Paivio’s dual coding theory suggest that humans process information through dual channels, one auditory and the other visual. ...

Conway and Sloane have previously given an upper bound on the minimum distance of a singly-even self-dual binary code, using the concept of the shadow of a self-dual code. We improve their bound, finding that the minimum distance of a selfdual binary code of length n is at most 4bn=24c+4, except when nmod24 = 22 , when the bound is 4bn=24c + 6. We also show that a code of length a multiple of 2...

interval is taken as T s. A similar problem, but in discrete time, more, if there is an m such that Tableh(m)#Table',(Y) for every has been considered in [l] where the authors have proposed an ad hoc linear encoding-decoding scheme which does not Y, then II E,H and Table~(k)=Table~(Z). With the computer asymptotically achieve the known performance bound for the we found the tables and from them...

Few weights codes have been an important topic of coding theory for decades. In this paper, a class of two-weight and three-weight codes for the homogeneous metric over the chain ring R = Fp + uFp + · · ·+ uFp are constructed. These codes are defined as trace codes. They are shown to be abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, we giv...