Improved Bounds on the Size of Separating Hash Families of Short Length

Penying Rochanakul

Abstract


In this paper, we present some new upper bounds on the size of separating hash families of type {w1,w2} of short length, where the length N is not exceeding 2w2. A new proof for tight bounds on the size of separating hash families of type {1, w} is also given.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|