Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "458d97ce-5c67-4e3a-9c73-31ce74a8e713"}, "_deposit": {"created_by": 139, "id": "7506", "owner": "139", "owners": [139], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "7506"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00007506", "sets": ["user-tcu"]}, "communities": ["tcu"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "T his paper expresses the applications of Boolean algebra by Boolean constants with the technical applications. First we have to express with rooted tree, binary tree, ordered tree and expression tree as the case of the graph in discrete version. T hen we have to express the prefix code tree by encoding and decoding. A ccording to the transformation of encoding to decoding and decoding to encoding, we can connect with discrete version and Boolean version over communications line. In addition probability version too."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "prefix code tree"}, {"interim": "encoding and decoding"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2021-01-16"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS.pdf", "filesize": [{"value": "325 KB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 325000.0, "url": {"url": "https://meral.edu.mm/record/7506/files/INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS.pdf"}, "version_id": "50b94090-ab2d-4690-858b-5b0ef6fbd228"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "Co-operative University, Thanlyin Research Journal 2020", "subitem_pages": "115-131", "subitem_volume": "Vol.4, No.1"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Moh Moh Kyi"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2020-08-01"}, "item_title": "INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS", "item_type_id": "21", "owner": "139", "path": ["1607959986665", "1608033663958"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000007506", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2021-01-16"}, "publish_date": "2021-01-16", "publish_status": "0", "recid": "7506", "relation": {}, "relation_version_is_last": true, "title": ["INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS"], "weko_shared_id": -1}
  1. Co-operative University, Thanlyin
  1. Co-operative University, Thanlyin
  2. Department of Mathematics

INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS

http://hdl.handle.net/20.500.12678/0000007506
http://hdl.handle.net/20.500.12678/0000007506
bb9e7220-0b43-4e64-ae99-eaeba42726c3
458d97ce-5c67-4e3a-9c73-31ce74a8e713
None
Preview
Name / File License Actions
INFORMATION INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS.pdf (325 KB)
license.icon
Publication type
Journal article
Upload type
Publication
Title
Title INFORMATION TECHNOLOGY BY BOOLEAN CONSTANTS
Language en
Publication date 2020-08-01
Authors
Moh Moh Kyi
Description
T his paper expresses the applications of Boolean algebra by Boolean constants with the technical applications. First we have to express with rooted tree, binary tree, ordered tree and expression tree as the case of the graph in discrete version. T hen we have to express the prefix code tree by encoding and decoding. A ccording to the transformation of encoding to decoding and decoding to encoding, we can connect with discrete version and Boolean version over communications line. In addition probability version too.
Keywords
prefix code tree, encoding and decoding
Journal articles
Co-operative University, Thanlyin Research Journal 2020
115-131
Vol.4, No.1
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2021-01-16 04:30:00.667179
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL