Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A steganographic method based on tetris games

From MaRDI portal
Publication:726479
Jump to:navigation, search

DOI10.1016/j.ins.2013.12.024zbMath1372.94452OpenAlexW2045246799MaRDI QIDQ726479

Ling-Hwei Chen, Zhan-He Ou

Publication date: 11 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.12.024


zbMATH Keywords

steganographytetriminotetrisundetectability


Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)


Related Items (2)

How fast can we play Tetris greedily with rectangular pieces? ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates



Cites Work

  • Unnamed Item
  • A new modification of the variational iteration method
  • A High-Capacity Steganography Scheme for JPEG2000 Baseline System


This page was built for publication: A steganographic method based on tetris games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:726479&oldid=12637126"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki